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

Spell check.

This commit is contained in:
Sylvain Pion 2007-04-17 16:04:28 +00:00
parent b2f7453776
commit 33870c52d7
3 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Principal_component_analysis/doc_tex/Principal_component_analysis/PkgDescription.tex
View File

@ -2,7 +2,7 @@
\begin{ccPkgDescription}{Principal Component Analysis\label{Pkg:PrincipalComponentAnalysisD}}
\ccPkgHowToCiteCgal{cgal:ap-pcad-07}
\ccPkgSummary{
This package provides functions to compute global informations on the
This package provides functions to compute global information on the
shape of a set of 2D or 3D objects such as points. It provides the
computation of axis-aligned bounding boxes, centroids of point sets,
barycenters of weighted point sets, as well as linear least squares

2
Principal_component_analysis/doc_tex/Principal_component_analysis/intro.tex
View File

@ -1,4 +1,4 @@
This \cgal\ package provides functions to compute global informations
This \cgal\ package provides functions to compute global information
on the shape of a set of 2D or 3D objects such as points. It provides the computation of axis-aligned bounding boxes, centroids of point sets, barycenters of weighted point sets, as well as linear least squares fitting for point sets in 2D, and point sets as well as triangle sets in 3D. The sets are specified by iterator ranges of containers.\\
\section{Definitions}

2
Principal_component_analysis/doc_tex/Principal_component_analysis_ref/intro.tex
View File

@ -14,7 +14,7 @@
This \cgal\ package provides functions to compute global informations
This \cgal\ package provides functions to compute global information
on the shape of a set of 2D or 3D objects such as points. It provides the computation of axis-aligned bounding boxes for point sets, centroids of point sets and triangle sets in 2D and 3D, barycenters of weighted point sets, as well as linear least squares fitting for point sets in 2D, and point sets and triangle sets in 3D. It assumes the set of kernel primitive elements to be stored into an iterator range of a container.