From a240c26d23ac1a70b20f017a93143d547f30807c Mon Sep 17 00:00:00 2001 From: Efi Fogel Date: Mon, 11 May 2015 23:49:01 +0300 Subject: [PATCH] Fixed typos in manual --- .../Concepts/PolygonConvexDecomposition_2.h | 3 --- Minkowski_sum_2/doc/Minkowski_sum_2/Minkowski_sum_2.txt | 9 ++++----- 2 files changed, 4 insertions(+), 8 deletions(-) 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 0c4faacb498..cf0c7fbe55b 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 @@ -30,9 +30,6 @@ public: /*! the point type, used to represent polygon vertices. */ typedef unspecified_type Point_2; - /*! the container of points type. */ - typedef unspecified_type Container; - /*! the polygon type, defined as `Polygon_2`. */ typedef unspecified_type Polygon_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 47e69aaec64..89de2cb1379 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 @@ -215,7 +215,7 @@ of a function operator (`operator()`) that accepts a planar polygon and returns a range of convex polygons that represents its convex decomposition. If at least one of \f$ P \f$ or \f$ Q \f$ is a polygon with holes, `decomp` is an object of a type that models the concept -`PolygonWithHolesConvexDecomposition`, which refines the concept +`PolygonWithHolesConvexDecomposition_2`, which refines the concept `PolygonConvexDecomposition` and adds a requirement for the provision of a function operator (`operator()`) that accepts a planar polygon with holes. @@ -478,7 +478,7 @@ represented as arcs of conic curves with rational coefficients. The \link offset_polygon_2() `offset_polygon_2(P, r, traits)`\endlink function template computes the offset of a given polygon \f$ P\f$ by a rational radius \f$ r\f$ in an exact manner. The input -polygon $P$ must be either simple or degenerate consisting of two +polygon \f$ P\f$ must be either simple or degenerate consisting of two vertices (representing a line segment). The `traits` argument must model the concept `ArrangementTraits_2` and it should be capable of handling conic arcs in an exact manner---using an instance of the @@ -511,7 +511,7 @@ counterparts that employ the convolution approach. However, similar to the functions that compute the general Minkowski sum, they are able to compute the offset of polygons with holes, given a decomposition strategy that handles polygons with holes, such as the -'Polygon_vertical_decomposition_2' class template. +`Polygon_vertical_decomposition_2` class template. \cgalAdvancedEnd \subsection mink_ssecinner_offset Computing Inner Offsets @@ -595,8 +595,7 @@ offset computation. They have also suggested a few algorithmic improvements that made their way into version 3.4, yielding a faster approximation scheme. During the Google Summer of Code 2014, Sebastian Morr, mentored by Michael Hemmer, implemented the reduced convolution approach, based on Alon -Baram's~2013 master's thesis. +Baram's master's thesis. */ } /* namespace CGAL */ -