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:31:42 +00:00
parent 35e3109822
commit 3112113428
4 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
HalfedgeDS/doc_tex/HalfedgeDS/PkgDescription.tex
View File

@ -2,14 +2,14 @@
\begin{ccPkgDescription}{Halfedge Data Structures \label{Pkg:HDS}}
\ccPkgHowToCiteCgal{cgal:k-hds-07}
\ccPkgSummary{A halfedge data structure is an edge-centered data structure
capable of maintaining incidence informations of vertices, edges and
capable of maintaining incidence information of vertices, edges and
faces, for example for planar maps, polyhedra, or other orientable,
two-dimensional surfaces embedded in arbitrary dimension. Each edge is
decomposed into two halfedges with opposite orientations. One incident
face and one incident vertex are stored in each halfedge. For each
face and each vertex, one incident halfedge is stored. Reduced
variants of the halfedge data structure can omit some of these
informations, for example the halfedge pointers in faces or the
information, for example the halfedge pointers in faces or the
storage of faces at all.}
%\ccPkgDependsOn{}

4
HalfedgeDS/doc_tex/HalfedgeDS/main.tex
View File

@ -36,14 +36,14 @@
A halfedge data structure (abbreviated as \ccc{HalfedgeDS}, or
\ccc{HDS} for template parameters) is an edge-centered data structure
capable of maintaining incidence informations of vertices, edges and
capable of maintaining incidence information of vertices, edges and
faces, for example for planar maps, polyhedra, or other orientable,
two-dimensional surfaces embedded in arbitrary dimension. Each edge is
decomposed into two halfedges with opposite orientations. One incident
face and one incident vertex are stored in each halfedge. For each
face and each vertex, one incident halfedge is stored. Reduced
variants of the halfedge data structure can omit some of these
informations, for example the halfedge pointers in faces or the
information, for example the halfedge pointers in faces or the
storage of faces at all.
% \begin{ccTexOnly}

2
HalfedgeDS/doc_tex/HalfedgeDS_ref/HalfedgeDS.tex
View File

@ -36,7 +36,7 @@ deprecated packages. The two designs are not interchangeable.
The concept of a halfedge data structure (abbreviated as \ccc{HalfedgeDS}, or
\ccc{HDS} for template parameters) defines an edge-centered data structure
capable of maintaining incidence informations of vertices, edges, and
capable of maintaining incidence information of vertices, edges, and
faces, for example for planar maps or polyhedral surfaces. It is a
combinatorial data structure, geometric interpretation is added by
classes built on top of the halfedge data structure.

2
HalfedgeDS/doc_tex/HalfedgeDS_ref/intro.tex
View File

@ -18,7 +18,7 @@
A halfedge data structure (abbreviated as \ccc{HalfedgeDS}, or
\ccc{HDS} for template parameters) is an edge-centered data structure
capable of maintaining incidence informations of vertices, edges and
capable of maintaining incidence information of vertices, edges and
faces, for example for planar maps or polyhedral surfaces. It is a
combinatorial data structure, geometric interpretation is added by
classes built on top of the halfedge data structure. These classes