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

Rebuild the how_to_cite structure

This commit is contained in:
Philipp Möller 2012-08-28 17:33:45 +00:00
parent c6e2a05c2c
commit e2616dafb1
52 changed files with 269 additions and 183 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Algebraic_foundations/doc/Algebraic_foundations/PackageDescription.txt
View File

@ -6,7 +6,7 @@
\PkgAuthor{Michael Hemmer}
\PkgDesc{This package defines what algebra means for \cgal, in terms of concepts, classes and functions. The main features are: (i) explicit concepts for interoperability of types (ii) separation between algebraic types (not necessarily embeddable into the reals), and number types (embeddable into the reals).}
\PkgSince{3.3}
\cgalbib{cgal:h-af-12}
\cgalbib{cgal:h-af}
\license{ \ref licensesLGPL "LGPL"}
\PkgDescriptionEnd
*/

2
Alpha_shapes_2/doc/Alpha_shapes_2/PackageDescription.txt
View File

@ -10,7 +10,7 @@
\PkgAuthor{Tran Kai Frank Da}
\PkgDesc{This package offers a data structure encoding the whole family of alpha-complexes related to a given 2D Delaunay or regular triangulation. In particular, the data structure allows to retrieve the alpha-complex for any alpha value, the whole spectrum of critical alpha values and a filtration on the triangulation faces (this filtration is based on the first alpha value for which each face is included on the alpha-complex).}
\PkgSince{2.1}
\cgalbib{ cgal:d-as2-12 }
\cgalbib{cgal:d-as2}
\license{ \ref licensesGPL "GPL" }
\PkgDescriptionEnd

2
Alpha_shapes_3/doc/Alpha_shapes_3/PackageDescription.txt
View File

@ -9,7 +9,7 @@
\PkgAuthor{Tran Kai Frank Da, Sébastien Loriot, and Mariette Yvinec}
\PkgDesc{This package offers a data structure encoding either one alpha-complex or the whole family of alpha-complexes related to a given 3D Delaunay or regular triangulation. In the latter case, the data structure allows to retrieve the alpha-complex for any alpha value, the whole spectrum of critical alpha values and a filtration on the triangulation faces (this filtration is based on the first alpha value for which each face is included on the alpha-complex). }
\PkgSince{2.3}
\cgalbib{ cgal:dy-as3-12 }
\cgalbib{cgal:dy-as3}
\license{ \ref licensesGPL "GPL" }
\PkgDescriptionEnd

2
Apollonius_graph_2/doc/Apollonius_graph_2/PackageDescription.txt
View File

@ -11,7 +11,7 @@
\PkgAuthor{Menelaos Karavelas and Mariette Yvinec}
\PkgDesc{Algorithms for computing the Apollonius graph in two dimensions. The Apollonius graph is the dual of the Apollonius diagram, also known as the <I>additively weighted Voronoi diagram</I>. The latter can be thought of as the Voronoi diagram of a set of disks under the Euclidean metric, and it is a generalization of the standard Voronoi diagram for points. The algorithms provided are dynamic.}
\PkgSince{3.0}
\cgalbib{ cgal:ky-ag2-12 }
\cgalbib{cgal:ky-ag2}
\license{ \ref licensesGPL "GPL" }
\PkgDescriptionEnd
*/

2
Arrangement_on_surface_2/doc/Sweep_line_2/PackageDescription.txt
View File

@ -7,7 +7,7 @@
\PkgAuthor{Baruch Zukerman, Ron Wein, and Efi Fogel}
\PkgDesc{This package provides three free functions implemented based on the sweep-line paradigm: given a collection of input curves, compute all intersection points, compute the set of subcurves that are pairwise interior-disjoint induced by them, and check whether there is at least one pair of curves among them that intersect in their interior.}
\PkgSince{2.4}
\cgalbib{ cgal:wfz-ic2-12 }
\cgalbib{cgal:wfz-ic2}
\license{ \ref licensesGPL "GPL" }
\PkgDescriptionEnd

2
Boolean_set_operations_2/doc/Boolean_set_operations_2/PackageDescription.txt
View File

@ -10,7 +10,7 @@
\PkgAuthor{Efi Fogel, Ophir Setter, Ron Wein, Guy Zucker, Baruch Zukerman, and Dan Halperin}
\PkgDesc{This package consists of the implementation of Boolean set-operations on point sets bounded by weakly x-monotone curves in 2-dimensional Euclidean space. In particular, it contains the implementation of regularized Boolean set-operations, intersection predicates, and point containment predicates.}
\PkgSince{3.2}
\cgalbib{ cgal:fwzh-rbso2-12 }
\cgalbib{cgal:fwzh-rbso2}
\license{ \ref licensesGPL "GPL" }
\PkgDescriptionEnd

2
Bounding_volumes/doc/Bounding_volumes/PackageDescription.txt
View File

@ -11,7 +11,7 @@
\PkgAuthor{Kaspar Fischer, Bernd G&auml;rtner, Thomas Herrmann, Michael Hoffmann, and Sven Sch&ouml;nherr}
\PkgDesc{This package provides algorithms for computing optimal bounding volumes of point sets. In d-dimensional space, the smallest enclosing sphere, ellipsoid (approximate), and annulus can be computed. In 3-dimensional space, the smallest enclosing strip is available as well, and in 2-dimensional space, there are algorithms for a number of additional volumes (rectangles, parallelograms, \f$ k=2,3,4\f$ axis-aligned rectangles). The smallest enclosing sphere algorithm can also be applied to a set of d-dimensional spheres.}
\PkgSince{1.1}
\cgalbib{ cgal:fghhs-bv-12 }
\cgalbib{cgal:fghhs-bv}
\license{ \ref licensesGPL "GPL" }
\PkgDescriptionEnd

2
Box_intersection_d/doc/Box_intersection_d/PackageDescription.txt
View File

@ -11,7 +11,7 @@
\PkgAuthor{Lutz Kettner, Andreas Meyer, and Afra Zomorodian}
\PkgDesc{An efficient algorithm for finding all intersecting pairs for large numbers of iso-oriented boxes, in order to apply a user defined callback on them. Typically these boxes will be bounding boxes of more complicated geometries. The algorithm is useful for (self-) intersection tests of surfaces etc. }
\PkgSince{3.1}
\cgalbib{ cgal:kmz-isiobd-12 }
\cgalbib{cgal:kmz-isiobd}
\license{ \ref licensesGPL "GPL" }
\PkgDescriptionEnd
*/

2
CGAL_ipelets/doc/CGAL_ipelets/PackageDescription.txt
View File

@ -11,7 +11,7 @@
\PkgAuthor{S&eacute;bastien Loriot and Sylvain Pion}
\PkgDesc{This package provides a generic framework to easily write ipelets (plug-in's) using \cgal for the the Ipe extensible drawing editor.}
\PkgSince{3.5}
\cgalbib{ cgal:lp-gi-12 }
\cgalbib{cgal:lp-gi}
\license{ \ref licensesLGPL "LGPL" }
\PkgDescriptionEnd
*/

2
Circulator/doc/Circulator/PackageDescription.txt
View File

@ -10,7 +10,7 @@
\PkgAuthor{Olivier Devillers, Lutz Kettner, Sylvain Pion, Michael Seel, and Mariette Yvinec}
\PkgDesc{This package descibes handles and circulators. They are related to iterators. Handles allow to dereference but neither to increment nor to decrement. Circulators have no notion of past-the-end, and they are used in \cgal whenever we have cyclic stuctures. }
\PkgSince{1.0}
\cgalbib{ cgal:dksy-hc-12 }
\cgalbib{cgal:dksy-hc}
\license{ \ref licensesLGPL "LGPL" }
\PkgDescriptionEnd

2
Convex_decomposition_3/doc/Convex_decomposition_3/PackageDescription.txt
View File

@ -8,7 +8,7 @@
\PkgAuthor{Peter Hachenberger}
\PkgDesc{This packages provides a function for decomposing a bounded polyhedron into convex sub-polyhedra. The decomposition yields \f$ O(r^2)\f$ convex pieces, where \f$ r\f$ is the number of edges, whose adjacent facets form an angle of more than 180 degrees with respect to the polyhedron's interior. This bound is worst-case optimal. }
\PkgSince{3.5}
\cgalbib{ cgal:h-emspe-12 }
\cgalbib{cgal:h-emspe}
\license{ \ref licensesGPL "GPL" }
\PkgDescriptionEnd
*/

2
Convex_hull_2/doc/Convex_hull_2/PackageDescription.txt
View File

@ -26,7 +26,7 @@
\PkgAuthor{Susan Hert and Stefan Schirra}
\PkgDesc{This package provides functions for computing convex hulls in two dimensions as well as functions for checking if sets of points are strongly convex are not. There are also a number of functions described for computing particular extreme points and subsequences of hull points, such as the lower and upper hull of a set of points.}
\PkgSince{1.0}
\cgalbib{ cgal:hs-chep2-12 }
\cgalbib{cgal:hs-chep2}
\license{ \ref licensesGPL "GPL" }
\PkgDescriptionEnd

2
Convex_hull_3/doc/Convex_hull_3/PackageDescription.txt
View File

@ -20,7 +20,7 @@
\PkgAuthor{Susan Hert and Stefan Schirra}
\PkgDesc{This package provides functions for computing convex hulls in three dimensions as well as functions for checking if sets of points are strongly convex or not. One can compute the convex hull of a set of points in three dimensions in one of three ways: using a static algorithm, using an incremental construction algorithm, or using a triangulation to get a fully dynamic computation.}
\PkgSince{1.1}
\cgalbib{ cgal:hs-ch3-12 }
\cgalbib{cgal:hs-ch3}
\license{ \ref licensesGPL "GPL" }
\PkgDescriptionEnd

2
Convex_hull_d/doc/Convex_hull_d/PackageDescription.txt
View File

@ -10,7 +10,7 @@
\PkgAuthor{Susan Hert and Michael Seel}
\PkgDesc{This package provides functions for computing convex hulls and Delaunay triangulations in \f$ d\f$-dimensional Euclidean space.}
\PkgSince{2.3}
\cgalbib{ cgal:hs-chdt3-12 }
\cgalbib{cgal:hs-chdt3}
\license{ \ref licensesGPL "GPL" }
\PkgDescriptionEnd
*/

5
Documentation/Doxyfile
View File

@ -203,12 +203,15 @@ ALIASES = "sc{1}=<span style=\"font-variant: small-caps;\">\1</sp
"cpp11=*C++11*" \
"CC=*C++*" \
"cgalexample{1}=<br><b>File</b> \ref \1 \include \1" \
"cgalbib{1}=\par \"BibTeX\" \cite \1b" \
"license{1}=\par \"License\" \1" \
"advanced=\attention" \
"beginadvanced=" \
"endadvanced="
# this alias controls linking to the how to cite page, it is also
# responsible for adding the -YY{a,b} suffix to a cite
ALIASES += "cgalbib{1}=\par \"BibTeX\" <a href=\"how_to_cite_cgal.html#\1-12b\">\1-12b</a>"
ALIASES += "advanced=\xrefitem advanceds \"Advanced\" \"Advanced\""
ALIASES += "refines=\xrefitem refiness \"Refines\" \"Refines\""
ALIASES += "requires=\xrefitem requiress \"Requires\" \"Requires\""

1
Documentation/DoxygenLayout.xml
View File

@ -22,6 +22,7 @@
<tab type="globals" visible="yes" title="" intro=""/>
</tab>
<tab type="examples" visible="yes" title="" intro=""/>
<tab type="user" url="@ref how_to_cite_cgal" title="How To Cite"/>
</navindex>
<!-- Layout definition for a class page -->

86
Documentation/biblio/makebiblio
View File

@ -11,50 +11,50 @@ if [ ! -f "$1" ]; then
echo "should be in the 'Manual' package, in Manual/doc_tex/Manual/..."
exit 1
fi
rm -f Biblio/how_to_cite_*.*
rm -f index.html
bibtex2html $1
perl -ni.bak -e 'BEGIN {
sub TeXencode($) {
my $url = shift;
$url =~ s/#/\\#/g;
$url =~ s/_/\\_/g;
$url =~ s/~/\\~/g;
$url =~ s/:/\\string:/g;
$url =~ s/&/\\&/g;
$url =~ s/%/\\%/g;
return $url;
}
}
/^ OPT[A-Z]/ && next;
s/CGAL /{CGAL} /g;
s/The {CGAL} Project/{The CGAL Project}/g;
s/{CGAL} Editorial Board/{CGAL Editorial Board}/g;
s/\{([0-9]\.[0-9])\}/{{$1}}/g;
s/3D /{3D} /g;
s/2D /{2D} /g;
s/dD /{dD} /g;
s/Delaunay /{Delaunay} /g;
s/Voronoi /{Voronoi} /g;
s/Minkowski /{Minkowski} /g;
s/Nef /{Nef} /g;
s/Apollonius /{Apollonius} /g;
s/Boolean /{Boolean} /g;
if(/ URL = /) {
(my $url) = (/ URL = {(.*)}/);
printf " NOTE = {%s},\n", TeXencode($url);
printf " ALTNOTE = {\\url{%s}},\n", $url;
next;
}
s/ URL = / NOTE = /;
print;' Biblio/how_to_cite_cgal.bib
bibtex2html -nodoc $1
mv ${1%.bib}_bib.html how_to_cite.html
perl -pi.bak -e 's/All publications/CGAL Manual Chapters/g;
s|-([0-9]{1,2})]|-$1 - <a href="./how_to_cite_cgal.bib">bibtex file</a>]|g;
s/#669999/#C0C0D0/g;
s/#badfe1/#C0C0D0/g;
s|http://www.cgal.org/Manual/[0-9.]*/doc_html/cgal_manual/|../|g;' Biblio/how_to_cite_cgal.html
rm -f index.html
cat > how_to_cite_cgal.txt <<'EOF'
/*!
\page how_to_cite_cgal Acknowledging %CGAL
%CGAL is implemented for the most part by researchers. The academic
world evaluates and rewards researchers for a good part by the
analysis of the number of published papers and the number of citations
of their papers, which measures their impact. In order to make the
%CGAL project attractive for researchers to contribute their work
(which allows users to benefit from new contributions), we are pushing
a model where the %CGAL manual chapters are considered like
publications, and can be cited in articles as such.
We therefore kindly ask users to cite %CGAL as appropriately as
possible in their papers, and to mention the use of %CGAL on the web
pages of their projects using %CGAL and provide us with links to these
web pages. Feel free to contact us in case you have any question or
remark on this topic.
We provide bibtex entries for the chapters of the User and Reference
Manual, as well as for publications directly related to the %CGAL
software.
## Citing the %CGAL Library or the %CGAL project ##
If you want to cite the %CGAL Library or project as a whole, please
- cite: %CGAL, Computational Geometry Algorithms Library, http://www.cgal.org
- use the following <a href="how_to_cite.html">bibtex entry</a>.
## Citing the User and Reference Manual ##
If you want to refer to %CGAL manual, please cite the appropriate
entry from the bibliographic entries for individual chapters listed
in the table below.
EOF
footer="*/"
sed -e "s|https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/||g" ${1%.bib}.html | sed -e "s|${1%.bib}_bib.html|how_to_cite.html|g" >> how_to_cite_cgal.txt
echo $footer >> how_to_cite_cgal.txt
echo
echo "Do not forget to commit, now!"

170
Documentation/biblio/manual-4.1.bib
View File

@ -12,9 +12,9 @@
@string{ complete_biblio_file_title = "CGAL Publications sorted by year" }
@string{ complete_biblio_page_title = "CGAL Publications sorted by year" }
@string{ filename_complete_biblio = "how_to_cite_cgal" }
@string{ filename_complete_biblio = "how_to_cite_cgal.tmp" }
@string{ head_tag.end = "layout.html" }
%@string{ head_tag.end = "layout.html" }
%@string{ header_of_contents = "header_of_contents" }
@string{ keyword_build_initials_index = 0 }
@ -42,7 +42,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, year = 2012
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html"
}
@ -52,7 +52,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:AlgebraicFoundations"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:AlgebraicFoundations"
, year = 2012
}
@ -62,7 +62,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:AlgebraicKerneld"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:AlgebraicKerneld"
, year = 2012
}
@ -72,7 +72,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:NumberTypes"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:NumberTypes"
, year = 2012
}
@ -82,7 +82,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:Polynomial"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:Polynomial"
, year = 2012
}
@ -92,7 +92,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:ModularArithmetic"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:ModularArithmetic"
, year = 2012
}
@ -102,7 +102,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:Kernel23"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:Kernel23"
, year = 2012
}
@ -112,7 +112,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:KernelD"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:KernelD"
, year = 2012
}
@ -122,7 +122,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:CircularKernel2"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:CircularKernel2"
, year = 2012
}
@ -132,7 +132,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:SphericalKernel3"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:SphericalKernel3"
, year = 2012
}
@ -142,7 +142,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:ConvexHull2"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:ConvexHull2"
, year = 2012
}
@ -152,7 +152,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:ConvexHull3"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:ConvexHull3"
, year = 2012
}
@ -162,7 +162,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:Polygon2"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:Polygon2"
, year = 2012
}
@ -172,7 +172,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:PolygonPartitioning2"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:PolygonPartitioning2"
, year = 2012
}
@ -182,7 +182,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:ConvexHullD"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:ConvexHullD"
, year = 2012
}
@ -192,7 +192,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:Polyhedron"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:Polyhedron"
, year = 2012
}
@ -202,7 +202,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:HDS"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:HDS"
, year = 2012
}
@ -212,7 +212,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:CombinatorialMaps"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:CombinatorialMaps"
, year = 2012
}
@ -222,7 +222,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:LinearCellComplex"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:LinearCellComplex"
, year = 2012
}
@ -232,7 +232,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:BooleanSetOperations2"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:BooleanSetOperations2"
, year = 2012
}
@ -242,7 +242,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:MinkowskiSum2"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:MinkowskiSum2"
, year = 2012
}
@ -252,7 +252,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:Nef2"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:Nef2"
, year = 2012
}
@ -262,7 +262,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:NefS2"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:NefS2"
, year = 2012
}
@ -272,7 +272,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:Nef3"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:Nef3"
, year = 2012
}
@ -282,7 +282,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:ConvexDecomposition3"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:ConvexDecomposition3"
, year = 2012
}
@ -292,7 +292,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:MinkowskiSum3"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:MinkowskiSum3"
, year = 2012
}
@ -302,7 +302,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:StraightSkeleton2"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:StraightSkeleton2"
, year = 2012
}
@ -312,7 +312,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:Arrangement2"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:Arrangement2"
, year = 2012
}
@ -322,7 +322,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:IntersectionOfCurves2"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:IntersectionOfCurves2"
, year = 2012
}
@ -332,7 +332,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:SnapRounding2"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:SnapRounding2"
, year = 2012
}
@ -342,7 +342,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:Envelope2"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:Envelope2"
, year = 2012
}
@ -352,7 +352,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:Envelope3"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:Envelope3"
, year = 2012
}
@ -362,7 +362,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:Triangulation2"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:Triangulation2"
, year = 2012
}
@ -372,7 +372,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:TDS2"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:TDS2"
, year = 2012
}
@ -382,7 +382,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:Triangulation3"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:Triangulation3"
, year = 2012
}
@ -392,7 +392,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:TDS3"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:TDS3"
, year = 2012
}
@ -402,7 +402,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:Periodic3Triangulation3"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:Periodic3Triangulation3"
, year = 2012
}
@ -412,7 +412,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:AlphaShape2"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:AlphaShape2"
, year = 2012
}
@ -422,7 +422,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:AlphaShapes3"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:AlphaShapes3"
, year = 2012
}
@ -432,7 +432,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:SegmentDelaunayGraph2"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:SegmentDelaunayGraph2"
, year = 2012
}
@ -442,7 +442,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:ApolloniusGraph2"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:ApolloniusGraph2"
, year = 2012
}
@ -452,7 +452,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:VoronoiDiagramAdaptor2"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:VoronoiDiagramAdaptor2"
, Year = 2012
}
@ -462,7 +462,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:Mesh2"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:Mesh2"
, year = 2012
}
@ -472,7 +472,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:SurfaceMesher3"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:SurfaceMesher3"
, year = 2012
}
@ -482,7 +482,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:SurfaceReconstructionFromPointSets"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:SurfaceReconstructionFromPointSets"
, year = 2012
}
@ -492,7 +492,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:SkinSurface3"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:SkinSurface3"
, year = 2012
}
@ -502,7 +502,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:Mesh_3"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:Mesh_3"
, year = 2012
}
@ -512,7 +512,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:SurfaceSubdivisionMethods3"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:SurfaceSubdivisionMethods3"
, year = 2012
}
@ -522,7 +522,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:SurfaceMeshSimplification"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:SurfaceMeshSimplification"
, year = 2012
}
@ -532,17 +532,17 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:SurfaceParameterization"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:SurfaceParameterization"
, year = 2012
}
@incollection{cgal:b-ss2-12b
, author = "Matthias B\"asken"
, author = "Matthias Bäsken"
, title = "{2D} Range and Neighbor Search"
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:PointSet2"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:PointSet2"
, year = 2012
}
@ -552,7 +552,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:RangeSegmentTreesD"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:RangeSegmentTreesD"
, year = 2012
}
@ -562,7 +562,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:IntervalSkipList"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:IntervalSkipList"
, year = 2012
}
@ -572,7 +572,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:SpatialSearchingD"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:SpatialSearchingD"
, year = 2012
}
@ -582,17 +582,17 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:BoxIntersectionD"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:BoxIntersectionD"
, year = 2012
}
@incollection{cgal:fghhs-bv-12b
, author = "Kaspar Fischer and Bernd G{\"a}rtner and Thomas Herrmann and Michael Hoffmann and Sven Sch{\"o}nherr"
, author = "Kaspar Fischer and Bernd G{\"a}rtner and Thomas Herrmann and Michael Hoffmann and Sven Schönherr"
, title = "Bounding Volumes"
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:BoundingVolumes"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:BoundingVolumes"
, year = 2012
}
@ -602,7 +602,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:QPSolver"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:QPSolver"
, year = 2012
}
@ -612,7 +612,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:InscribedAreas"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:InscribedAreas"
, year = 2012
}
@ -623,7 +623,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:OptimalDistances"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:OptimalDistances"
, year = 2012
}
@ -633,7 +633,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:Interpolation2"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:Interpolation2"
, year = 2012
}
@ -643,7 +643,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:PrincipalComponentAnalysisD"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:PrincipalComponentAnalysisD"
, year = 2012
}
@ -653,7 +653,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:PlacementOfStreamlines2"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:PlacementOfStreamlines2"
, year = 2012
}
@ -663,7 +663,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:Ridges_3"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:Ridges_3"
, year = 2012
}
@ -673,7 +673,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:Jet_fitting_3"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:Jet_fitting_3"
, year = 2012
}
@ -683,7 +683,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:PointSetProcessing"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:PointSetProcessing"
, year = 2012
}
@ -693,7 +693,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:Kds"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:Kds"
, year = 2012
}
@ -703,7 +703,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:KdsFramework"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:KdsFramework"
, year = 2012
}
@ -713,7 +713,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:BGL"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:BGL"
, year = 2012
}
@ -723,7 +723,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:Property_map"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:Property_map"
, year = 2012
}
@ -733,7 +733,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:SpatialSorting"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:SpatialSorting"
, year = 2012
}
@ -743,7 +743,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:AABB_tree"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:AABB_tree"
, year = 2012
}
@ -753,7 +753,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:MatrixSearch"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:MatrixSearch"
, year = 2012
}
@ -763,7 +763,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:StlExtension"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:StlExtension"
, year = 2012
}
@ -773,17 +773,17 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:HandlesAndCirculators"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:HandlesAndCirculators"
, year = 2012
}
@incollection{cgal:dhhk-gog-12b
, author = "Olivier Devillers and Susan Hert and Michael Hoffmann and Lutz Kettner and Sven Sch\"onherr"
, author = "Olivier Devillers and Susan Hert and Michael Hoffmann and Lutz Kettner and Sven Schönherr"
, title = "Geometric Object Generators"
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:Generators"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:Generators"
, year = 2012
}
@ -793,7 +793,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:ProfilingTools"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:ProfilingTools"
, year = 2012
}
@ -803,7 +803,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:IOstreams"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:IOstreams"
, year = 2012
}
@ -813,7 +813,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:Geomview"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:Geomview"
, year = 2012
}
@ -823,7 +823,7 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:GraphicsView"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:GraphicsView"
, year = 2012
}
@ -833,6 +833,6 @@
, publisher = "{CGAL Editorial Board}"
, edition = "{4.1}"
, booktitle = "{CGAL} User and Reference Manual"
, url = "http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:CGALIpelets"
, url = "https://cgal.geometryfactory.com/~pmoeller/Doxygen/CGAL.CGAL/html/packages.html#Pkg:CGALIpelets"
, year = 2012
}

2
Documentation/doc/Installation.txt
View File

@ -4,5 +4,7 @@
\author CGAL Editorial Board
\attention NOT PORTED YET
*/

83
Documentation/doc/packages.txt
View File

@ -15,138 +15,213 @@ h1 {
\section PartAlgebraicFoundations Arithmetic and Algebra
<a name="Pkg:AlgebraicFoundations"></a>
\package_listing{Algebraic_foundations}
<a name="Pkg:NumberTypes"></a>
\package_listing{NumberTypeSupport}
<a name="Pkg:ModularArithmetic"></a>
\package_listing{Modular_arithmetic}
<a name="Pkg:Polynomial"></a>
\package_listing{Polynomial}
<a name="Pkg:AlgebraicKerneld"></a>
\package_listing{Algebraic_kernel_d}
\section PartCombinatorialAlgorithms Combinatorial Algorithms
<a name="Pkg:MatrixSearch"></a>
\package_listing{Matrix_search}
<a name="Pkg:QPSolver"></a>
\package_listing{QP_solver}
\section PartKernels Geometry Kernels
<a name="Pkg:Kernel23"></a>
\package_listing{Kernel_23}
<a name="Pkg:KernelD"></a>
\package_listing{Kernel_d}
<a name="Pkg:CircularKernel2"></a>
\package_listing{Circular_kernel_2}
<a name="Pkg:SphericalKernel3"></a>
\package_listing{Circular_kernel_3}
\section PartConvexHullAlgorithms Convex Hull Algorithms
<a name="Pkg:ConvexHull2"></a>
\package_listing{Convex_hull_2}
<a name="Pkg:ConvexHull3"></a>
\package_listing{Convex_hull_3}
<a name="Pkg:ConvexHullD"></a>
\package_listing{Convex_hull_d}
\section PartPolygons Polygons
<a name="Pkg:Polygon2"></a>
\package_listing{Polygon}
<a name="Pkg:BooleanSetOperations2"></a>
\package_listing{Boolean_set_operations_2}
<a name="Pkg:Nef2"></a>
\package_listing{Nef_2}
<a name="Pkg:NefS2"></a>
\package_listing{Nef_S2}
<a name="Pkg:PolygonPartitioning2"></a>
\package_listing{Partition_2}
<a name="Pkg:StraightSkeleton2"></a>
\package_listing{Straight_skeleton_2}
<a name="Pkg:MinkowskiSum2"></a>
\package_listing{Minkowski_sum_2}
\section PartPolyhedra Cell Complexes and Polyhedra
<a name="Pkg:Polyhedron"></a>
\package_listing{Polyhedron}
<a name="Pkg:HDS"></a>
\package_listing{HalfedgeDS}
<a name="Pkg:CombinatorialMaps"></a>
\package_listing{Combinatorial_map}
<a name="Pkg:LinearCellComplex"></a>
\package_listing{Linear_cell_complex}
<a name="Pkg:Nef3"></a>
\package_listing{Nef_3}
<a name="Pkg:ConvexDecomposition3"></a>
\package_listing{Convex_decomposition_3}
<a name="Pkg:MinkowskiSum3"></a>
\package_listing{Minkowski_sum_3}
\section PartArrangements Arrangements
<a name="Pkg:Arrangement2"></a>
\package_listing{Arrangement_on_surface_2}
<a name="Pkg:IntersectionOfCurves2"></a>
\package_listing{Arrangement_on_surface_2/Sweep_line_2}
<a name="Pkg:SnapRounding2"></a>
\package_listing{Snap_rounding_2}
<a name="Pkg:Envelope2"></a>
\package_listing{Envelope_2}
<a name="Pkg:Envelope3"></a>
\package_listing{Envelope_3}
\section PartTriangulationsAndDelaunayTriangulations Triangulations and Delaunay Triangulations
<a name="Pkg:Triangulation2"></a>
\package_listing{Triangulation_2}
<a name="Pkg:TDS2"></a>
\package_listing{Triangulation_2/TDS_2}
<a name="Pkg:Triangulation3"></a>
\package_listing{Triangulation_3}
<a name="Pkg:TDS3"></a>
\package_listing{TriangulationDS_3}
<a name="Pkg:Periodic3Triangulation3"></a>
\package_listing{Periodic_3_triangulation_3}
<a name="Pkg:AlphaShape2"></a>
\package_listing{Alpha_shapes_2}
<a name="Pkg:AlphaShapes3"></a>
\package_listing{Alpha_shapes_3}
\section PartVoronoiDiagrams Voronoi Diagrams
<a name="Pkg:SegmentDelaunayGraph2"></a>
\package_listing{Segment_Delaunay_graph_2}
<a name="Pkg:ApolloniusGraph2"></a>
\package_listing{Apollonius_graph_2}
<a name="Pkg:VoronoiDiagramAdaptor2"></a>
\package_listing{Voronoi_diagram_2}
\section PartMeshing Mesh Generation
<a name="Pkg:Mesh2"></a>
\package_listing{Mesh_2}
<a name="Pkg:SurfaceMesher3"></a>
\package_listing{Surface_mesher}
<a name="Pkg:SurfaceReconstructionFromPointSets"></a>
\package_listing{Surface_reconstruction_points_3}
<a name="Pkg:SkinSurface3"></a>
\package_listing{Skin_surface_3}
<a name="Pkg:Mesh_3"></a>
\package_listing{Mesh_3}
\section PartGeometryProcessing Geometry Processing
<a name="Pkg:SurfaceSubdivisionMethods3"></a>
\package_listing{Subdivision_method_3}
<a name="Pkg:SurfaceMeshSimplification"></a>
\package_listing{Surface_mesh_simplification}
<a name="Pkg:SurfaceParameterization"></a>
\package_listing{Surface_mesh_parameterization}
<a name="Pkg:PlacementOfStreamlines2"></a>
\package_listing{Stream_lines_2}
<a name="Pkg:Ridges_3"></a>
\package_listing{Ridges_3}
<a name="Pkg:Jet_fitting_3"></a>
\package_listing{Jet_fitting_3}
<a name="Pkg:PointSetProcessing"></a>
\package_listing{Point_set_processing_3}
\section PartSearchStructures Spatial Searching and Sorting
<a name="Pkg:PointSet2"></a>
\package_listing{Point_set_2}
<a name="Pkg:IntervalSkipList"></a>
\package_listing{Interval_skip_list}
<a name="Pkg:SpatialSearchingD"></a>
\package_listing{Spatial_searching}
<a name="Pkg:RangeSegmentTreesD"></a>
\package_listing{SearchStructures}
<a name="Pkg:BoxIntersectionD"></a>
\package_listing{Box_intersection_d}
<a name="Pkg:AABB_tree"></a>
\package_listing{AABB_tree}
<a name="Pkg:SpatialSorting"></a>
\package_listing{Spatial_sorting}
\section PartGeometricOptimization Geometric Optimization
<a name="Pkg:BoundingVolumes"></a>
\package_listing{Bounding_volumes}
<a name="Pkg:InscribedAreas"></a>
\package_listing{Inscribed_areas}
<a name="Pkg:OptimalDistances"></a>
\package_listing{Polytope_distance_d}
<a name="Pkg:PrincipalComponentAnalysisD"></a>
\package_listing{Principal_component_analysis}
\section PartInterpolation Interpolation
<a name="Pkg:Interpolation2"></a>
\package_listing{Interpolation}
\section PartKineticDataStructures Kinetic Data Structures
<a name="Pkg:Kds"></a>
\package_listing{Kinetic_data_structures}
<a name="Pkg:KdsFramework"></a>
\package_listing{Kinetic_framework}
\section PartSupportLibrary Support Library
<a name="Pkg:StlExtension"></a>
\package_listing{STL_Extension}
<a name="Pkg:BGL"></a>
\package_listing{BGL}
<a name="Pkg:Property_map"></a>
\package_listing{Property_map}
<a name="Pkg:HandlesAndCirculators"></a>
\package_listing{Circulator}
<a name="Pkg:Generators"></a>
\package_listing{Generator}
<a name="Pkg:ProfilingTools"></a>
\package_listing{Miscellany}
<a name="Pkg:IOstreams"></a>
\package_listing{IOstream}
\section PartVisualization Visualization
<a name="Pkg:Geomview"></a>
\package_listing{Geomview}
<a name="Pkg:GraphicsView"></a>
\package_listing{GraphicsView}
<a name="Pkg:CGALIpelets"></a>
\package_listing{CGAL_ipelets}
*/

12
Documentation/doxyassist.xml
View File

@ -8,10 +8,11 @@ namespace for the XML file to be processed properly. -->
xmlns:da="http://simply-life.net/doxyassist/doxyassist.xsd"
version="1.0" type="generic" name="My DoxyAssist Project">
<doxygen doxyfile="Doxyfile">
<!-- we need to consider to migrate all settings here, although
that might make upgrading less pleasant -->
<list name="HTML_EXTRA_FILES" append="true">
<item>jquery.footnotes.min.js</item>
</list>
</doxygen>
<projects>
<project>
<namespace>CGAL</namespace>
@ -691,9 +692,14 @@ namespace for the XML file to be processed properly. -->
<version>4.1</version>
<versionSpecific>false</versionSpecific>
<input>./doc</input>
<input>./biblio/how_to_cite_cgal.txt</input>
<output>./output</output>
<logDirectory>./log</logDirectory>
<doxygen>
<list name="HTML_EXTRA_FILES" append="true">
<item>./biblio/how_to_cite.html</item>
</list>
<string name="LAYOUT_FILE">DoxygenLayout.xml</string>
<string name="GENERATE_TAGFILE">./tags/Manual.tag</string>
<string name="EXAMPLE_PATH">../Convex_hull_2/examples</string>

2
Envelope_2/doc/Envelope_2/PackageDescription.txt
View File

@ -11,7 +11,7 @@
\PkgAuthor{Ron Wein}
\PkgDesc{This package consits of functions that computes the lower (or upper) envelope of a set of arbitrary curves in 2D. The output is represented as an envelope diagram, namely a subdivision of the \f$ x\f$-axis into intervals, such that the identity of the curves that induce the envelope on each interval is unique.}
\PkgSince{3.3}
\cgalbib{ cgal:w-e2-12 }
\cgalbib{cgal:w-e2}
\license{ \ref licensesGPL "GPL" }
\PkgDescriptionEnd

2
Envelope_3/doc/Envelope_3/PackageDescription.txt
View File

@ -11,7 +11,7 @@
\PkgAuthor{Dan Halperin, Michal Meyerovitch, Ron Wein, and Baruch Zukerman}
\PkgDesc{This package consits of functions that compute the lower (or upper) envelope of a set of arbitrary surfaces in 3D. The output is represented as an 2D envelope diagram, namely a planar subdivision such that the identity of the surfaces that induce the envelope over each diagram cell is unique.}
\PkgSince{3.3}
\cgalbib{ cgal:mwz-e3-12 }
\cgalbib{cgal:mwz-e3}
\license{ \ref licensesGPL "GPL" }
\PkgDescriptionEnd

2
Generator/doc/Generator/PackageDescription.txt
View File

@ -10,7 +10,7 @@
Hoffmann, Lutz Kettner, and Sven Sch&ouml;nherr}
\PkgDesc{This package provides a variety of generators for geometric objects. They are useful as synthetic test data sets, e.g. for testing algorithms on degenerate object sets and for performance analysis. }
\PkgSince{1.0}
\cgalbib{ cgal:dhhk-gog-12 }
\cgalbib{cgal:dhhk-gog}
\license{ \ref licensesLGPL "LGPL" }
\PkgDescriptionEnd

2
Geomview/doc/Geomview/PackageDescription.txt
View File

@ -11,7 +11,7 @@
\PkgAuthor{Andreas Fabri and Sylvain Pion}
\PkgDesc{This package implements an interface to Geomview, an interactive 3D viewing program, originally developed at the Geometry Center in Minneapolis.}
\PkgSince{2.0}
\cgalbib{ cgal:fp-gv-12 }
\cgalbib{cgal:fp-gv}
\license{ \ref licensesLGPL "LGPL" }
\PkgDescriptionEnd
*/

2
GraphicsView/doc/GraphicsView/PackageDescription.txt
View File

@ -11,7 +11,7 @@
\PkgAuthor{Andreas Fabri and Laurent Rineau}
\PkgDesc{This package provides classes for displaying \cgal objects and data structures in the <A HREF="http://doc.qt.nokia.com/latest/graphicsview.html">Qt 4 Graphics View Framework</A>.}
\PkgSince{3.4}
\cgalbib{ cgal:fr-cqgvf-12 }
\cgalbib{cgal:fr-cqgvf}
\license{ \ref licensesGPL "GPL" }
\PkgDescriptionEnd

2
HalfedgeDS/doc/HalfedgeDS/PackageDescription.txt
View File

@ -9,7 +9,7 @@
\PkgAuthor{Lutz Kettner}
\PkgDesc{A halfedge data structure is an edge-centered data structure 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 information, for example the halfedge pointers in faces or the storage of faces at all.}
\PkgSince{1.0}
\cgalbib{ cgal:k-hds-12 }
\cgalbib{cgal:k-hds}
\license{ \ref licensesLGPL "LGPL" }
\PkgDescriptionEnd

2
Interval_skip_list/doc/Interval_skip_list/PackageDescription.txt
View File

@ -9,7 +9,7 @@
\PkgAuthor{Andreas Fabri}
\PkgDesc{An interval skip list is a data structure for finding all intervals that contain a point, and for stabbing queries, that is for answering the question whether a given point is contained in an interval or not. For a triangulated terrain, this allows to quickly identify the triangles which intersect an iso line. }
\PkgSince{3.0}
\cgalbib{ cgal:f-isl-12 }
\cgalbib{cgal:f-isl}
\license{ \ref licensesGPL "GPL" }
\PkgDescriptionEnd

2
Jet_fitting_3/doc/Jet_fitting_3/PackageDescription.txt
View File

@ -9,7 +9,7 @@
\PkgAuthor{Marc Pouget and Fr&eacute;d&eacute;ric Cazals}
\PkgDesc{For a surface discretized as a point cloud or a mesh, it is desirable to estimate pointwise differential quantities. More precisely, first order properties correspond to the normal or the tangent plane; second order properties provide the principal curvatures and directions, third order properties provide the directional derivatives of the principal curvatures along the curvature lines, etc. This package allows the estimation of local differential quantities of a surface from a point sample.}
\PkgSince{3.3}
\cgalbib{ cgal:pc-eldp-12 }
\cgalbib{cgal:pc-eldp}
\license{ \ref licensesGPL "GPL" }
\PkgDescriptionEnd
*/

2
Kernel_23/doc/Kernel_23/Kernel_23.txt
View File

@ -4,6 +4,8 @@ namespace CGAL {
\mainpage 2D and 3D Geometry %Kernel
\anchor chapterkernel23
\autotoc
\authors Herv&eacute; Br&ouml;nnimann, Andreas Fabri, Geert-Jan Giezeman, Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, and Stefan Schirra
# Introduction # {#kernel_intro}

2
Kernel_23/doc/Kernel_23/PackageDescription.txt
View File

@ -35,7 +35,7 @@
\PkgAuthor{Herv&eacute; Br&ouml;nnimann, Andreas Fabri, Geert-Jan Giezeman, Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, and Stefan Schirra}
\PkgDesc{This package contains kernels each containing objects of constant size, such as point, vector, direction, line, ray, segment, circle as well as predicates and constructions for these objects. The kernels mainly differ in the way they handle robustness issues.}
\PkgSince{0.9}
\cgalbib{ cgal:bfghhkps-lgk23-12 }
\cgalbib{cgal:bfghhkps-lgk23}
\license{ \ref licensesLGPL "LGPL" }
\PkgDescriptionEnd
*/

2
Mesh_2/doc/Mesh_2/PackageDescription.txt
View File

@ -10,7 +10,7 @@
\PkgAuthor{Laurent Rineau}
\PkgDesc{This package implements a Delaunay refinement algorithm to construct conforming triangulations and 2D meshes. Conforming Delaunay triangulations are obtained from constrained Delaunay triangulations by refining constrained edges until they are Delaunay edges. Conforming Gabriel triangulations are obtained by further refining constrained edges until they become Gabriel edges. The package provides also a 2D mesh generator that refines triangles and constrained edges until user defined size and shape criteria on triangles are satisfied. The package can handle intersecting input constraints and set no restriction on the angle formed by two constraints sharing an endpoint.}
\PkgSince{3.1}
\cgalbib{ cgal:r-ctm2-12 }
\cgalbib{cgal:r-ctm2}
\license{ \ref licensesGPL "GPL" }
\PkgDescriptionEnd
*/

2
Mesh_3/doc/Mesh_3/PackageDescription.txt
View File

@ -11,7 +11,7 @@
\PkgAuthor{Pierre Alliez, Laurent Rineau, Stéphane Tayeb, Jane Tournois, Mariette Yvinec}
\PkgDesc{This package is devoted to the generation of isotropic simplicial meshes discretizing 3D domains. The domain to be meshed is a region of 3D space that has to be bounded. The region may be connected or composed of multiple components and/or subdivided in several subdomains. The domain is input as an oracle able to answer queries, of a few different types, on the domain. Boundary and subdivision surfaces are either smooth or piecewise smooth surfaces, formed with planar or curved surface patches. Surfaces may exhibit 1-dimensional features (e.g. crease edges) and 0-dimensional features (e.g. singular points as corners tips, cusps or darts), that have to be fairly approximated in the mesh. }
\PkgSince{3.5}
\cgalbib{ cgal:rty-m3-12 }
\cgalbib{cgal:rty-m3}
\license{ \ref licensesGPL "GPL" }
\PkgDescriptionEnd
*/

2
Minkowski_sum_2/doc/Minkowski_sum_2/PackageDescription.txt
View File

@ -11,7 +11,7 @@
\PkgAuthor{Ron Wein}
\PkgDesc{This package consists of functions that compute the Minkowski sum of two simple straight-edge polygons in the plane. It also contains functions for computing the Minkowski sum of a polygon and a disc, an operation known as <I>offsetting</I> or <I>dilating</I> a polygon. The package can compute the exact representation of the offset polygon, or provide a guaranteed approximation of the offset.}
\PkgSince{3.3}
\cgalbib{ cgal:w-rms2-12 }
\cgalbib{cgal:w-rms2}
\license{ \ref licensesGPL "GPL" }
\PkgDescriptionEnd

2
Minkowski_sum_3/doc/Minkowski_sum_3/PackageDescription.txt
View File

@ -9,7 +9,7 @@
\PkgAuthor{Peter Hachenberger}
\PkgDesc{This package provides a function, which computes the Minkowski sum of two point sets in \f$ \mathbb{R}^3\f$. These point sets may consist of isolated vertices, isolated edges, surfaces with convex facets without holes, and open and closed solids. Thus, it is possible to compute the configuration space of translational robots (even in tight passage scenarios) as well as several graphics operations, like for instance the glide operation, which computes the point set swept by a polyhedron that moves along a polygonal line.}
\PkgSince{3.5}
\cgalbib{ cgal:h-msp3-12 }
\cgalbib{cgal:h-msp3}
\license{ \ref licensesGPL "GPL" }
\PkgDescriptionEnd
*/

2
Miscellany/doc/Miscellany/PackageDescription.txt
View File

@ -11,7 +11,7 @@
\PkgAuthor{Lutz Kettner, Sylvain Pion, and Michael Seel}
\PkgDesc{This package provides classes for profiling time and memory consumption, a hash map, a union find data structure and a modifier.}
\PkgSince{3.2}
\cgalbib{ cgal:kps-pthum-12 }
\cgalbib{cgal:kps-pthum}
\license{ \ref licensesLGPL "LGPL" }
\PkgDescriptionEnd

2
Modular_arithmetic/doc/Modular_arithmetic/PackageDescription.txt
View File

@ -11,7 +11,7 @@
\PkgAuthor{Michael Hemmer and Sylvain Pion}
\PkgDesc{This package provides arithmetic over finite fields. The provided tools are in particular useful for filters based on modular arithmetic and algorithms based on Chinese remainder. }
\PkgSince{3.4}
\cgalbib{ cgal:h-ma-12 }
\cgalbib{cgal:h-ma}
\license{ \ref licensesLGPL "LGPL" }
\PkgDescriptionEnd
*/

2
Nef_2/doc/Nef_2/PackageDescription.txt
View File

@ -11,7 +11,7 @@
\PkgAuthor{Michael Seel}
\PkgDesc{A Nef polygon is any set that can be obtained from a finite set of open halfspaces by set complement and set intersection operations. Due to the fact that all other binary set operations like union, difference and symmetric difference can be reduced to intersection and complement calculations, Nef polygons are also closed under those operations. Apart from the set complement operation there are more topological unary set operations that are closed in the domain of Nef polygons interior, boundary, and closure.}
\PkgSince{2.3}
\cgalbib{ cgal:s-bonp2-12 }
\cgalbib{cgal:s-bonp2}
\license{ \ref licensesGPL "GPL" }
\PkgDescriptionEnd

4
Nef_3/doc/Nef_3/PackageDescription.txt
View File

@ -6,12 +6,12 @@
/*!
\addtogroup PkgNef3
\todo check generated documentation
\PkgDescriptionBegin{3D Boolean Operations on Nef Polyhedra}
\PkgDescriptionBegin{3D Boolean Operations on Nef Polyhedra}
\PkgPicture{Nef_3-teaser.png}
\PkgAuthor{Peter Hachenberger and Lutz Kettner}
\PkgDesc{3D Nef polyhedra, are a boundary representation for cell-complexes bounded by halfspaces that supports Boolean operations and topological operations in full generality including unbounded cells, mixed dimensional cells (e.g., isolated vertices and antennas). Nef polyhedra distinguish between open and closed sets and can represent non-manifold geometry.}
\PkgSince{3.1}
\cgalbib{ cgal:hk-bonp3-12 }
\cgalbib{cgal:hk-bonp3}
\license{ \ref licensesGPL "GPL" }
\PkgDescriptionEnd

2
Nef_S2/doc/Nef_S2/PackageDescription.txt
View File

@ -11,7 +11,7 @@
\PkgAuthor{Peter Hachenberger and Lutz Kettner}
\PkgDesc{This package offers the equivalent to 2D Nef Polygons in the plane. Here halfplanes correspond to half spheres delimited by great circles.}
\PkgSince{3.1}
\cgalbib{ cgal:hk-bonpes2-12 }
\cgalbib{cgal:hk-bonpes2}
\license{ \ref licensesGPL "GPL"}
\PkgDescriptionEnd

2
Partition_2/doc/Partition_2/PackageDescription.txt
View File

@ -11,7 +11,7 @@
\PkgAuthor{Susan Hert}
\PkgDesc{This package provides functions for partitioning polygons in monotone or convex polygons. The algorithms can produce results with the minimal number of polygons, as well as approximations which have no more than four times the optimal number of convex pieces but they differ in their runtime complexities.}
\PkgSince{2.3}
\cgalbib{ cgal:h-pp2-12 }
\cgalbib{cgal:h-pp2}
\license{ \ref licensesGPL "GPL" }
\PkgDescriptionEnd

2
Point_set_2/doc/Point_set_2/PackageDescription.txt
View File

@ -13,7 +13,7 @@
\PkgAuthor{Matthias B&auml;sken}
\PkgDesc{This package supports circular, triangular, and isorectangular range search queries as well as (k) nearest neighbor search queries on 2D point sets. In contrast to the spatial searching package, this package uses a Delaunay triangulation as underlying data structure.}
\PkgSince{2.1}
\cgalbib{ cgal:b-ss2-12 }
\cgalbib{cgal:b-ss2}
\license{ \ref licensesGPL "GPL" }
\PkgDescriptionEnd

2
Polytope_distance_d/doc/Polytope_distance_d/PackageDescription.txt
View File

@ -9,7 +9,7 @@
\PkgAuthor{Kaspar Fischer, Bernd G&auml;rtner, Thomas Herrmann, Michael Hoffmann, and Sven Sch&ouml;nherr}
\PkgDesc{This package provides algorithms for computing the distance between the convex hulls of two point sets in d-dimensional space, without explicitely constructing the convex hulls. It further provides an algorithm to compute the width of a point set, and the furthest point for each vertex of a convex polygon. }
\PkgSince{1.1}
\cgalbib{ cgal:fghhs-od-12 }
\cgalbib{cgal:fghhs-od}
\license{ \ref licensesGPL "GPL" }
\PkgDescriptionEnd

2
STL_Extension/doc/STL_Extension/PackageDescription.txt
View File

@ -9,7 +9,7 @@
\PkgAuthor{Michael Hoffmann, Lutz Kettner, Sylvain Pion, and Ron Wein}
\PkgDesc{\cgal is designed in the spirit of the generic programming paradigm to work together with the Standard Template Library (\stl). This package provides non-geometric \stl-like algorithms and datastructures that are not provided in the \stl standard but in \cgal}
\PkgSince{1.0}
\cgalbib{ cgal:hkpw-se-12 }
\cgalbib{cgal:hkpw-se}
\license{ \ref licensesLGPL "LGPL" }
\PkgDescriptionEnd
*/

2
Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/PackageDescription.txt
View File

@ -11,7 +11,7 @@
\PkgAuthor{Menelaos Karavelas}
\PkgDesc{An algorithm for computing the dual of a Voronoi diagram of a set of segments under the Euclidean metric. It is a generalization of the standard Voronoi diagram for points. The algorithms provided are dynamic.}
\PkgSince{3.1}
\cgalbib{ cgal:k-sdg2-12 }
\cgalbib{cgal:k-sdg2}
\license{ \ref licensesGPL }
\PkgDescriptionEnd
*/

2
Skin_surface_3/doc/Skin_surface_3/PackageDescription.txt
View File

@ -10,7 +10,7 @@
\PkgAuthor{Nico Kruithof}
\PkgDesc{This package allows to build a triangular mesh of a skin surface. Skin surfaces are used for modeling large molecules in biological computing. The surface is defined by a set of balls, representing the atoms of the molecule, and a shrink factor that determines the size of the smooth patches gluing the balls together. The construction of a triangular mesh of a smooth skin surface is often necessary for further analysis and for fast visualization. This package provides functions to construct a triangular mesh approximating the skin surface from a set of balls and a shrink factor. It also contains code to subdivide the mesh efficiently. }
\PkgSince{3.3}
\cgalbib{ cgal:k-ssm3-12 }
\cgalbib{cgal:k-ssm3}
\license{ \ref licensesGPL "GPL" }
\PkgDescriptionEnd

2
Snap_rounding_2/doc/Snap_rounding_2/PackageDescription.txt
View File

@ -9,7 +9,7 @@
\PkgAuthor{Eli Packer}
\PkgDesc{Snap Rounding is a well known method for converting arbitrary-precision arrangements of segments into a fixed-precision representation. In the study of robust geometric computing, it can be classified as a finite precision approximation technique. Iterated Snap Rounding is a modification of Snap Rounding in which each vertex is at least half-the-width-of-a-pixel away from any non-incident edge. This package supports both methods.}
\PkgSince{3.1}
\cgalbib{ cgal:p-sr2-12 }
\cgalbib{cgal:p-sr2}
\license{ \ref licensesGPL "GPL" }
\PkgDescriptionEnd
*/

2
Spatial_searching/doc/Spatial_searching/PackageDescription.txt
View File

@ -31,7 +31,7 @@
\PkgAuthor{Hans Tangelder and Andreas Fabri}
\PkgDesc{This package implements exact and approximate distance browsing by providing exact and approximate algorithms for range searching, k-nearest and k-furthest neighbor searching, as well as incremental nearest and incremental furthest neighbor searching, where the query items are points in dD Euclidean space.}
\PkgSince{3.0}
\cgalbib{ cgal:tf-ssd-12 }
\cgalbib{cgal:tf-ssd}
\license{ \ref licensesGPL "GPL" }
\PkgDescriptionEnd
*/

2
Straight_skeleton_2/doc/Straight_skeleton_2/PackageDescription.txt
View File

@ -11,7 +11,7 @@
\PkgAuthor{Fernando Cacciola}
\PkgDesc{This package implements an algorithm to construct a halfedge data structure representing the straight skeleton in the interior of 2D polygons with holes and an algorithm to construct inward offset polygons at any offset distance given a straight skeleton.}
\PkgSince{3.2}
\cgalbib{ cgal:c-sspo2-12 }
\cgalbib{cgal:c-sspo2}
\license{ \ref licensesGPL "GPL" }
\PkgDescriptionEnd
*/

2
Triangulation_2/doc/TDS_2/PackageDescription.txt
View File

@ -11,7 +11,7 @@
\PkgAuthor{Sylvain Pion and Mariette Yvinec}
\PkgDesc{This package provides a data structure to store a two-dimensional triangulation that has the topology of a two-dimensional sphere. The package acts as a container for the vertices and faces of the triangulation and provides basic combinatorial operation on the triangulation. }
\PkgSince{2.2}
\cgalbib{ cgal:py-tds2-12 }
\cgalbib{cgal:py-tds2}
\license{ \ref licensesGPL "GPL" }
\PkgDescriptionEnd

3
Triangulation_2/doc/Triangulation_2/Concepts/TriangulationFaceBase_2.h
View File

@ -28,8 +28,5 @@ and only provided for symmetry with the vertex case.
class TriangulationFaceBase_2 {
public:
/// @}
}; /* end TriangulationFaceBase_2 */

2
Triangulation_2/doc/Triangulation_2/PackageDescription.txt
View File

@ -9,7 +9,7 @@
\PkgAuthor{Mariette Yvinec}
\PkgDesc{This package allows to build and handle various triangulations for point sets two dimensions. Any \cgal triangulation covers the convex hull of its vertices. Triangulations are build incrementally and can be modified by insertion or removal of vertices. They offer point location facilities. The package provides plain triangulation (whose faces depend on the insertion order of the vertices) and Delaunay triangulations. Regular triangulations are also provided for sets of weighted points. Delaunay and regular triangulations offer nearest neighbor queries and primitives to build the dual Voronoi and power diagrams. Finally, constrained and Delaunay constrained triangulations allows to force some constrained segments to appear as edges of the triangulation. Several versions of constrained and Delaunay constrained triangulations are provided: some of them handle intersections between input constraints segment while others do not. }
\PkgSince{0.9}
\cgalbib{ cgal:y-t2-12 }
\cgalbib{cgal:y-t2}
\license{ \ref licensesGPL "GPL" }
\PkgDescriptionEnd