From f704c838fd0c891a4e1b17aaf9f9dc11f29c4cbb Mon Sep 17 00:00:00 2001 From: Laurent Rineau Date: Fri, 1 Mar 2019 16:27:22 +0100 Subject: [PATCH] Rewrap CHANGES.md --- Installation/CHANGES.md | 111 ++++++++++++++++++++++++---------------- 1 file changed, 66 insertions(+), 45 deletions(-) diff --git a/Installation/CHANGES.md b/Installation/CHANGES.md index 7bf71f27806..7bf8f7d7e16 100644 --- a/Installation/CHANGES.md +++ b/Installation/CHANGES.md @@ -8,40 +8,53 @@ Release date: March 2019 ### 2D Periodic Hyperbolic Triangulations (new package) - - This package allows the computation of Delaunay triangulations of the Bolza surface. - The Bolza surface is the most symmetric hyperbolic surface of genus 2. Its fundamental - domain is the regular hyperbolic octagon with angles π/4 centered at the origin of the - Poincaré disk. Triangulations of the Bolza surface can be seen as triangulations of the - hyperbolic plane that are periodic in the four directions defined by the sides of this - regular octagon. + - This package allows the computation of Delaunay triangulations of + the Bolza surface. The Bolza surface is the most symmetric + hyperbolic surface of genus 2. Its fundamental domain is the + regular hyperbolic octagon with angles π/4 centered at the origin + of the Poincaré disk. Triangulations of the Bolza surface can be + seen as triangulations of the hyperbolic plane that are periodic + in the four directions defined by the sides of this regular + octagon. ### 2D Hyperbolic Triangulations (new package) - - This package allows the computation of Delaunay Triangulations of sets of points in the - Poincaré disk, which is one of the conformal models for the hyperbolic plane. + + - This package allows the computation of Delaunay Triangulations of + sets of points in the Poincaré disk, which is one of the + conformal models for the hyperbolic plane. ### The Heat Method (new package) -- This package provides an algorithm that solves the single- or multiple-source - shortest path problem by returning an approximation of the geodesic distance - for all vertices of a triangle mesh to the closest vertex in a given set of - source vertices. + +- This package provides an algorithm that solves the single- or + multiple-source shortest path problem by returning an + approximation of the geodesic distance for all vertices of a + triangle mesh to the closest vertex in a given set of source + vertices. ### Triangulated Surface Mesh Approximation (new package) -- This package implements the Variational Shape Approximation method to approximate - an input surface triangle mesh by a simpler surface triangle mesh. +- This package implements the Variational Shape Approximation method + to approximate an input surface triangle mesh by a simpler surface + triangle mesh. ### Polygon Mesh Processing package -- Added the following new functions to detect and repair issues in polygon soups: - - `CGAL::Polygon_mesh_processing::remove_isolated_points_in_polygon_soup()`, which detects and removes - points that are not used in any polygon of the soup. + +- Added the following new functions to detect and repair issues in + polygon soups: + - `CGAL::Polygon_mesh_processing::remove_isolated_points_in_polygon_soup()`, + which detects and removes points that are not used in any + polygon of the soup. - `CGAL::Polygon_mesh_processing::merge_duplicate_points_in_polygon_soup()`, - which detects and merges points that share the same geometric position. + which detects and merges points that share the same geometric + position. - `CGAL::Polygon_mesh_processing::merge_duplicate_polygons_in_polygon_soup()`, which detects and merges polygons that are identical. - - `CGAL::Polygon_mesh_processing::repair_polygon_soup()`, - which applies a number of repairing steps (a subset of which are the functions above) - to clean and repair a polygon soup. -- Added the following new functions to detect and repair degeneracies in polygon meshes: + - `CGAL::Polygon_mesh_processing::repair_polygon_soup()`, which + applies a number of repairing steps (a subset of which are the + functions above) to clean and repair a polygon soup. + +- Added the following new functions to detect and repair + degeneracies in polygon meshes: - `CGAL::Polygon_mesh_processing::degenerate_edges()` - `CGAL::Polygon_mesh_processing::degenerate_faces()` - `CGAL::Polygon_mesh_processing::is_non_manifold_vertex()` @@ -53,19 +66,23 @@ Release date: March 2019 - `CGAL::Polygon_mesh_processing::extract_boundary_cycles()` - `CGAL::Polygon_mesh_processing::merge_duplicated_vertices_in_boundary_cycle()` - `CGAL::Polygon_mesh_processing::merge_duplicated_vertices_in_boundary_cycles()` -- Added the class `CGAL::Rigid_triangle_mesh_collision_detection` to detect intersections between meshes - and volumes undergoing affine transformations. + +- Added the class `CGAL::Rigid_triangle_mesh_collision_detection` to + detect intersections between meshes and volumes undergoing affine + transformations. ### Regularized Boolean Set Operations in 2D package + - Fixed the validation of orientation of relative simple polygons. ### Point Set Processing -- `CGAL::mst_orient_normals()` can now be called with a set of user-selected - seed points that are known to be already oriented. A new optional named - parameter `point_is_constrained_map` is added for this purpose. The - original behavior (using one unique and automatically selected seed) is - kept if this parameter is not used. +- `CGAL::mst_orient_normals()` can now be called with a set of + user-selected seed points that are known to be already oriented. A + new optional named parameter `point_is_constrained_map` is added + for this purpose. The original behavior (using one unique and + automatically selected seed) is kept if this parameter is not + used. ### Classification @@ -73,14 +90,15 @@ Release date: March 2019 `TensorFlow::Neural_network_classifier`. - For uniformity, `ETHZ_random_forest_classifier` is renamed - `ETHZ::Random_forest_classifier` and `OpenCV_random_forest_classifier` - is renamed `OpenCV::Random_forest_classifier`. + `ETHZ::Random_forest_classifier` and + `OpenCV_random_forest_classifier` is renamed + `OpenCV::Random_forest_classifier`. - The training algorithm of `ETHZ::Random_forest_classifier` was parallelized. -- Added a constructor to copy a `ETHZ::Random_forest_classifier` using a - different data set as input. +- Added a constructor to copy a `ETHZ::Random_forest_classifier` + using a different data set as input. - Added 3 new geometric features, `Height_above`, `Height_below` and `Vertical_range`. @@ -88,20 +106,22 @@ Release date: March 2019 ### 3D Fast Intersection and Distance Computation - The primitives `AABB_face_graph_triangle_primitive` and - `AABB_halfedge_graph_segment_primitive` now use as `Id` a pair of descriptor and - graph pointer in the case they are configured to deal with a possible different - graph per primitive (configuration set using a template tag). + `AABB_halfedge_graph_segment_primitive` now use as `Id` a pair of + descriptor and graph pointer in the case they are configured to + deal with a possible different graph per primitive (configuration + set using a template tag). ### 2D Arrangements -- Fixed a bug in the surface-sweep framework (`Surface_sweep_2`) that ensures - that an event is never left without (left or right) curves. +- Fixed a bug in the surface-sweep framework (`Surface_sweep_2`) + that ensures that an event is never left without (left or right) + curves. -- Fixed a constructor of `Arr_counting_traits.h`. (In particular, added missing - const of a parameter). +- Fixed a constructor of `Arr_counting_traits.h`. (In particular, + added missing const of a parameter). -- Fixed zone computation of a curve in cases where the lexicographic smallest - end of the curve lies on the parameter space. +- Fixed zone computation of a curve in cases where the lexicographic + smallest end of the curve lies on the parameter space. - Implemented missing function object `Compare_x_near_boundary` of `Arr_polyline_traits_2`, `Arr_polycurve_traits_2`, and @@ -115,9 +135,10 @@ Release date: March 2019 ### 2D Minkowski Sums -- Fixed a bug in the function that computed the Minkowski sum using the - reduced-convolution method. In particular, correctly handled the case where - one of the summands does not have an outer boundaey. +- Fixed a bug in the function that computed the Minkowski sum using + the reduced-convolution method. In particular, correctly handled + the case where one of the summands does not have an outer + boundary. ### 3D Point Set