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

Cite Behar & Lien's paper in reduced convolution M-sum method documentation

This commit is contained in:
Sebastian Morr 2014-08-13 14:24:33 +02:00
parent f4bbfab665
commit c6360ce3a4
2 changed files with 16 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
Documentation/biblio/cgal_manual.bib
View File

@ -2335,6 +2335,15 @@ ADDRESS = "Saarbr{\"u}cken, Germany"
series = {Texts and Monographs in Symbolic Computation} series = {Texts and Monographs in Symbolic Computation}
} }
@conference {cgal:bl-frmsurc-11
,address = {San Francisco, CA}
,author = {Evan Behar and Jyh-Ming Lien}
,booktitle = {Proc. {IEEE} Int. Conf. Intel. Rob. Syst. ({IROS})}
,month = {Sep.}
,title = {Fast and Robust 2D Minkowski Sum Using Reduced Convolution}
,year = {2011}
}
% ---------------------------------------------------------------------------- % ----------------------------------------------------------------------------
% END OF BIBFILE % END OF BIBFILE
% ---------------------------------------------------------------------------- % ----------------------------------------------------------------------------

12
Minkowski_sum_2/doc/Minkowski_sum_2/CGAL/minkowski_sum_2.h
View File

@ -22,11 +22,13 @@ const Polygon_2<Kernel,Container>& Q);
/*! /*!
\ingroup PkgMinkowskiSum2 \ingroup PkgMinkowskiSum2
Computes the Minkowski sum \f$ P \oplus Q\f$ of the two given polygons. Computes the Minkowski sum \f$ P \oplus Q\f$ of the two given polygons. The
The function computes the reduced convolution of the two polygons and function computes the reduced convolution \cgalCite{cgal:bl-frmsurc-11} of
extracts those loops of the convolution which are part of the Minkowsi the two polygons and extracts those loops of the convolution which are part of
sum. This method works very efficiently, regardless of whether `P` and the Minkowsi sum. This method works very efficiently, regardless of whether `P`
`Q` are convex or non-convex. and `Q` are convex or non-convex. It is usually faster than the full
convolution method, except in degenerate cases where the output polygon has
many holes.
Note that as the input polygons may not be convex, their Minkowski Note that as the input polygons may not be convex, their Minkowski
sum may not be a simple polygon. The result is therefore represented sum may not be a simple polygon. The result is therefore represented
as a polygon with holes. as a polygon with holes.