songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Fixed typos in manual

This commit is contained in:
Efi Fogel 2015-05-11 23:49:01 +03:00
parent 5dea491467
commit a240c26d23
2 changed files with 4 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
Minkowski_sum_2/doc/Minkowski_sum_2/Concepts/PolygonConvexDecomposition_2.h
View File

@ -30,9 +30,6 @@ public:
/*! the point type, used to represent polygon vertices. */ /*! the point type, used to represent polygon vertices. */
typedef unspecified_type Point_2; typedef unspecified_type Point_2;
/*! the container of points type. */
typedef unspecified_type Container;
/*! the polygon type, defined as `Polygon_2<Kernel,Container>`. */ /*! the polygon type, defined as `Polygon_2<Kernel,Container>`. */
typedef unspecified_type Polygon_2; typedef unspecified_type Polygon_2;

9
Minkowski_sum_2/doc/Minkowski_sum_2/Minkowski_sum_2.txt
View File

@ -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. 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, 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 `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 `PolygonConvexDecomposition` and adds a requirement for the provision
of a function operator (`operator()`) that accepts a planar polygon with of a function operator (`operator()`) that accepts a planar polygon with
holes. 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 \link offset_polygon_2() `offset_polygon_2(P, r, traits)`\endlink
function template computes the offset of a given polygon \f$ P\f$ 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 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 vertices (representing a line segment). The `traits` argument must model
the concept `ArrangementTraits_2` and it should be capable of handling the concept `ArrangementTraits_2` and it should be capable of handling
conic arcs in an exact manner---using an instance of the 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 functions that compute the general Minkowski sum, they are able to compute
the offset of polygons with holes, given a decomposition strategy that the offset of polygons with holes, given a decomposition strategy that
handles polygons with holes, such as the handles polygons with holes, such as the
'Polygon_vertical_decomposition_2<Kernel>' class template. `Polygon_vertical_decomposition_2<Kernel>` class template.
\cgalAdvancedEnd \cgalAdvancedEnd
\subsection mink_ssecinner_offset Computing Inner Offsets \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. that made their way into version 3.4, yielding a faster approximation scheme.
During the <I>Google Summer of Code</I> 2014, Sebastian Morr, mentored by During the <I>Google Summer of Code</I> 2014, Sebastian Morr, mentored by
Michael Hemmer, implemented the reduced convolution approach, based on Alon Michael Hemmer, implemented the reduced convolution approach, based on Alon
Baram's~2013 master's thesis. Baram's master's thesis.
*/ */
} /* namespace CGAL */ } /* namespace CGAL */