diff --git a/Box_intersection_d/doc_tex/Box_intersection_d/PkgDescription.tex b/Box_intersection_d/doc_tex/Box_intersection_d/PkgDescription.tex index 6877067f3d6..e8309b03557 100644 --- a/Box_intersection_d/doc_tex/Box_intersection_d/PkgDescription.tex +++ b/Box_intersection_d/doc_tex/Box_intersection_d/PkgDescription.tex @@ -1,5 +1,6 @@ \begin{ccPkgDescription}{Intersecting Sequences of dD Iso-oriented Boxes\label{Pkg:BoxIntersectionD}} +\ccHowToCite{cgal:kmz-isiobd-06} \ccPkgSummary{ An efficient algorithm for finding all intersecting pairs for large numbers of iso-oriented boxes, in order to apply a user defined callback diff --git a/Core/include/CORE/CORE.h b/Core/include/CORE/CORE.h index 299899a2a16..065d1e9a39b 100644 --- a/Core/include/CORE/CORE.h +++ b/Core/include/CORE/CORE.h @@ -94,3 +94,4 @@ using namespace CORE; #endif // _CORE_CORE_H_ + diff --git a/Interpolation/doc_tex/Interpolation/PkgDescription.tex b/Interpolation/doc_tex/Interpolation/PkgDescription.tex index 1b25c972b08..8c73eb60e08 100644 --- a/Interpolation/doc_tex/Interpolation/PkgDescription.tex +++ b/Interpolation/doc_tex/Interpolation/PkgDescription.tex @@ -1,5 +1,6 @@ \begin{ccPkgDescription}{2D and Surface Function Interpolation\label{Pkg:Interpolation2}} +\ccHowToCite{cgal:f-i-06} \ccPkgSummary{ This package implements different methods for scattered data interpolation: Given measures of a function on a set of discrete data diff --git a/Interval_skip_list/doc_tex/Interval_skip_list/PkgDescription.tex b/Interval_skip_list/doc_tex/Interval_skip_list/PkgDescription.tex new file mode 100644 index 00000000000..4a859bc2a9e --- /dev/null +++ b/Interval_skip_list/doc_tex/Interval_skip_list/PkgDescription.tex @@ -0,0 +1,12 @@ + +\begin{ccPkgDescription}{Interlval Skip Lists\label{Pkg:IntervalSkipList}} +\ccHowToCite{cgal:f-isl-06} +\ccPkgSummary{An interval skip list is a data strucure 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. } + +%\ccPkgDependsOn{} +\ccPkgIntroducedInCGAL{3.1} +\ccPkgLicense{\ccLicenseQPL} +\end{ccPkgDescription} diff --git a/Interval_skip_list/doc_tex/Interval_skip_list/main.tex b/Interval_skip_list/doc_tex/Interval_skip_list/main.tex index a01d5c65707..63629128533 100644 --- a/Interval_skip_list/doc_tex/Interval_skip_list/main.tex +++ b/Interval_skip_list/doc_tex/Interval_skip_list/main.tex @@ -4,8 +4,8 @@ \ccParDims -\ccUserChapter{Interval Skip List} -\label{chapter_Interval_skip_list} +\ccUserChapter{Interval Skip List\label{chapter_Interval_skip_list}} +\input{Interval_skip_list/PkgDescription.tex} \ccChapterRelease{\IntervalskiplistRev. \ \IntervalskiplistDate} \ccChapterAuthor{Andreas Fabri} diff --git a/Manual/doc_tex/Manual/manual.bib b/Manual/doc_tex/Manual/manual.bib index 7986aaf1291..1b641ddb13d 100755 --- a/Manual/doc_tex/Manual/manual.bib +++ b/Manual/doc_tex/Manual/manual.bib @@ -42,8 +42,8 @@ ,url = "http://www.cgal.org/Manual/3.2/doc_html/cgal_manual/index.html" } -@incollection{cgal:fgsp-k23-06 -, author = "Andreas Fabri and Geert-Jan Giezeman Susan Hert and Michael Hoffmann and Lutz Kettner and Stefan Schirra and Sylvain Pion" +@incollection{cgal:bfghhkps-k23-06 +, author = "Herv\'e Br\"onnimann and Andreas Fabri and Geert-Jan Giezeman and Susan Hert and Michael Hoffmann and Lutz Kettner and Stefan Schirra and Sylvain Pion" , title = "2D and 3D Kernel" , editor = "CGAL Editorial Board" , booktitle = "CGAL-3.2 User and Reference Manual" @@ -81,6 +81,15 @@ } +@incollection{cgal:gw-p2-06 +, author = "Geert-Jan Giezeman and Wieger Wesselink" +, title = "2D Polygons" +, editor = "CGAL Editorial Board" +, booktitle = "CGAL-3.2 User and Reference Manual" +, url = "http://www.cgal.org/Manual/3.2/doc_html/cgal_manual/pkgdescription.html#Pkg:Polygon2" +, year = 2006 +} + @incollection{cgal:hs-chdt3-06 , author = "Susan Hert and Michael Seel" , title = "dD Convex Hulls and Delaunay Triangulations" @@ -203,16 +212,7 @@ , year = 2006 } -@incollection{cgal:y-t3-06 -, author = "Mariette Yvinec" -, title = "2D Triangulations" -, editor = "CGAL Editorial Board" -, booktitle = "CGAL-3.2 User and Reference Manual" -, url = "http://www.cgal.org/Manual/3.2/doc_html/cgal_manual/pkgdescription.html#Pkg:Triangulation2" -, year = 2006 -} - -@incollection{cgal:y-t3-06 +@incollection{cgal:pt-t3-06 , author = "Sylvain Pion and Monique Teillaud" , title = "3D Triangulations" , editor = "CGAL Editorial Board" @@ -293,7 +293,7 @@ , year = 2006 } -@incollection{cgal:as-ssm2-06 +@incollection{cgal:s-ssm2-06 , author = "Le-Jeng Andy Shiue" , title = "3D Surface Subdivision Methods" , editor = "CGAL Editorial Board" @@ -322,9 +322,26 @@ , year = 2006 } +@incollection{cgal:f-isl-06 +, author = "Andreas Fabri" +, title = "Interval Skip List" +, editor = "CGAL Editorial Board" +, booktitle = "CGAL-3.2 User and Reference Manual" +, url = "http://www.cgal.org/Manual/3.2/doc_html/cgal_manual/pkgdescription.html#Pkg:IntervalSkipList" +, year = 2006 +} + +@incollection{cgal:tf-ssd-06 +, author = "Hans Tangelder and Andreas Fabri" +, title = "dD Spatial Searching" +, editor = "CGAL Editorial Board" +, booktitle = "CGAL-3.2 User and Reference Manual" +, url = "http://www.cgal.org/Manual/3.2/doc_html/cgal_manual/pkgdescription.html#Pkg:SpatialSearchingD" +, year = 2006 +} @incollection{cgal:kmz-isiobd-06 -, author = "Lutz Kettner, Andreas Meyer, and Afra Zomorodian" +, author = "Lutz Kettner and Andreas Meyer and Afra Zomorodian" , title = "Intersecting Sequences of dD Iso-oriented Boxes" , editor = "CGAL Editorial Board" , booktitle = "CGAL-3.2 User and Reference Manual" @@ -333,6 +350,16 @@ } +@incollection{cgal:fghhps-go-06 +, author = "Kaspar Fischer and Bernd G{\"a}rtner and Thomas Herrmann and Michael Hoffmann + and Eli Packer and Sven Sch{\"o}nherr" +, title = "Interpolation" +, editor = "CGAL Editorial Board" +, booktitle = "CGAL-3.2 User and Reference Manual" +, url = "http://www.cgal.org/Manual/3.2/doc_html/cgal_manual/pkgdescription.html#Pkg:Interpolation2" +, year = 2006 +} + @incollection{cgal:f-i-06 , author = "Julia Fl\"ototto" , title = "Interpolation" @@ -343,7 +370,7 @@ } -@incollection{cgal:ap--06 +@incollection{cgal:ap-pcad-06 , author = "Pierre Alliez and Sylvain Pion" , title = "dD Principal Component Analysis" , editor = "CGAL Editorial Board" diff --git a/Optimisation_doc/doc_tex/Optimisation/PkgDescription.tex b/Optimisation_doc/doc_tex/Optimisation/PkgDescription.tex index 8b5c95d7433..ab6971ac431 100644 --- a/Optimisation_doc/doc_tex/Optimisation/PkgDescription.tex +++ b/Optimisation_doc/doc_tex/Optimisation/PkgDescription.tex @@ -1,5 +1,6 @@ \begin{ccPkgDescription}{Bounding Volumes \label{Pkg:BoundingVolumes}} +\ccHowToCite{cgal:fghhps-go-06} \ccPkgSummary{ This package provides algorithms for computing bounding volumes of point sets in d-dimensional space, as the smallest enclosing sphere, annulus, ellipsoid, or strip. For 2-dimensional space, a number of additional volumes (rectangles, parallelograms) are available.} @@ -9,6 +10,7 @@ This package provides algorithms for computing bounding volumes of point sets in \end{ccPkgDescription} \begin{ccPkgDescription}{Inscribed Areas \label{Pkg:InscribedAreas}} +\ccHowToCite{cgal:fghhps-go-06} \ccPkgSummary{ This package provides algorithms for computing inscribed areas of (convex hulls of) point sets in 2-dimensional space, as the largest inscribed k-gon (area or perimeter) and the largest inscribed rectangle.} @@ -18,6 +20,7 @@ This package provides algorithms for computing inscribed areas of (convex hulls \end{ccPkgDescription} \begin{ccPkgDescription}{Center Points \label{Pkg:CenterPoints}} +\ccHowToCite{cgal:fghhps-go-06} \ccPkgSummary{ This package provides algorithms for optimally covering a 2-dimensional point set with $k=2,3,4$ axis-aligned boxes.} @@ -27,6 +30,7 @@ This package provides algorithms for optimally covering a 2-dimensional point se \end{ccPkgDescription} \begin{ccPkgDescription}{Polytope Distance \label{Pkg:OptimalDistances}} +\ccHowToCite{cgal:fghhps-go-06} \ccPkgSummary{ This package provides an algorithm for computing the distance between the convex hulls of two point sets in d-dimensional space. Due to built-in floating-point filters, the computations are fast but still exact in low dimensions. } @@ -37,6 +41,7 @@ This package provides an algorithm for computing the distance between the convex \begin{ccPkgDescription}{Smallest Enclosing Spheres of Spheres \label{Pkg:EnclosingSpheres}} +\ccHowToCite{cgal:fghhps-go-06} \ccPkgSummary{ This package provides an algorithm for computing the smallest sphere containing a set of spheres in d-dimensional space. On top of the exact algorithm, a fast and very robust floating-point variant is available.} @@ -46,6 +51,7 @@ This package provides an algorithm for computing the smallest sphere containing \end{ccPkgDescription} \begin{ccPkgDescription}{Matrix Search \label{Pkg:MatrixSearch}} +\ccHowToCite{cgal:fghhps-go-06} \ccPkgSummary{ This package provides an abstract optimisation frameworks that can be used to model many concrete problems.} diff --git a/Optimisation_doc/doc_tex/Optimisation/main.tex b/Optimisation_doc/doc_tex/Optimisation/main.tex index 39ddb1cd5d6..dc2688a62c6 100644 --- a/Optimisation_doc/doc_tex/Optimisation/main.tex +++ b/Optimisation_doc/doc_tex/Optimisation/main.tex @@ -10,10 +10,10 @@ % $Date$ % ============================================================================= -\ccUserChapter{Geometric Optimization} \label{Optimisation} +\ccUserChapter{Geometric Optimization \label{Optimisation}} \ccChapterRelease{Release: WIP (\today)} \ccChapterAuthor{Kaspar Fischer \and Bernd G{\"a}rtner \and Thomas Herrmann \and Michael Hoffmann - \and Sven Sch{\"o}nherr} + \and Eli Packer \and Sven Sch{\"o}nherr} %\minitoc diff --git a/Optimisation_doc/doc_tex/Optimisation_ref/intro.tex b/Optimisation_doc/doc_tex/Optimisation_ref/intro.tex index 9dfd4296deb..fb0001c7441 100644 --- a/Optimisation_doc/doc_tex/Optimisation_ref/intro.tex +++ b/Optimisation_doc/doc_tex/Optimisation_ref/intro.tex @@ -23,7 +23,7 @@ %% ----------------------------------------------------------------------------- \ccRefChapter{Geometric Optimization} \ccChapterAuthor{Kaspar Fischer \and Bernd G{\"a}rtner \and Thomas Herrmann \and Michael Hoffmann - \and Sven Sch{\"o}nherr} + \and Eli Packer \and Sven Sch{\"o}nherr} This chapter describes concepts, classes, and functions for solving diff --git a/Point_set_2/doc_tex/Point_set_2/PkgDescription.tex b/Point_set_2/doc_tex/Point_set_2/PkgDescription.tex new file mode 100644 index 00000000000..0075fc4f1a2 --- /dev/null +++ b/Point_set_2/doc_tex/Point_set_2/PkgDescription.tex @@ -0,0 +1,11 @@ + +\begin{ccPkgDescription}{2D Search Structures\label{Pkg:PointSet2}} +\ccHowToCite{cgal:b-ss2-06} +\ccPkgSummary{ +This package supports circular, triangular, and isorectangular range search +queries as well as (k) nearest neighbor search queries on 2D point sets.} + +\ccPkgDependsOn{\ccRef[2D Delaunay triangulation]{Pkg:Triangulation2}} +\ccPkgIntroducedInCGAL{3.1} +\ccPkgLicense{\ccLicenseQPL} +\end{ccPkgDescription} diff --git a/Point_set_2/doc_tex/Point_set_2/main.tex b/Point_set_2/doc_tex/Point_set_2/main.tex index 92534781985..fcfc5ee234b 100644 --- a/Point_set_2/doc_tex/Point_set_2/main.tex +++ b/Point_set_2/doc_tex/Point_set_2/main.tex @@ -8,10 +8,10 @@ \ccParDims -\ccUserChapter{2D Search Structures} -\label{chapterPoint_set_2} +\ccUserChapter{2D Search Structures\label{chapterPoint_set_2}} \ccChapterAuthor{Matthias B\"asken} +\input{Point_set_2/PkgDescription.tex} \minitoc \input{Point_set_2/Point_set_2} diff --git a/Polygon/doc_tex/Polygon/PkgDescription.tex b/Polygon/doc_tex/Polygon/PkgDescription.tex new file mode 100644 index 00000000000..940318c547c --- /dev/null +++ b/Polygon/doc_tex/Polygon/PkgDescription.tex @@ -0,0 +1,11 @@ + +\begin{ccPkgDescription}{2D Polygon\label{Pkg:Polygon2}} +\ccHowToCite{cgal:gw-p2-06} +\ccPkgSummary{ +This package provides a polygon class and operations on +sequences of points, like the simplicity test.} + +%\ccPkgDependsOn{} +\ccPkgIntroducedInCGAL{1.0} +\ccPkgLicense{\ccLicenseLGPL} +\end{ccPkgDescription} diff --git a/Polygon/doc_tex/Polygon/main.tex b/Polygon/doc_tex/Polygon/main.tex index 64dbcab58ab..534db25ebc7 100644 --- a/Polygon/doc_tex/Polygon/main.tex +++ b/Polygon/doc_tex/Polygon/main.tex @@ -2,6 +2,7 @@ \label{Polygon} \ccChapterAuthor{Geert-Jan Giezeman \and Wieger Wesselink} +\input{Polygon/PkgDescription.tex} \input{Polygon/polygon.tex} diff --git a/Principal_component_analysis/doc_tex/Principal_component_analysis/PkgDescription.tex b/Principal_component_analysis/doc_tex/Principal_component_analysis/PkgDescription.tex index 196958bb0fd..56b18a97d43 100644 --- a/Principal_component_analysis/doc_tex/Principal_component_analysis/PkgDescription.tex +++ b/Principal_component_analysis/doc_tex/Principal_component_analysis/PkgDescription.tex @@ -1,5 +1,6 @@ \begin{ccPkgDescription}{Principal Component Analysis\label{Pkg:PrincipalComponentAnalysisD}} +\ccHowToCite{cgal:ap-pcad-06} \ccPkgSummary{ This package provides functions to compute global informations on the shape of a set of 2D or 3D objects such as points. It provides the diff --git a/SearchStructures/doc_tex/SearchStructures/PkgDescription.tex b/SearchStructures/doc_tex/SearchStructures/PkgDescription.tex index dc2c475a7e2..47de041cf9d 100644 --- a/SearchStructures/doc_tex/SearchStructures/PkgDescription.tex +++ b/SearchStructures/doc_tex/SearchStructures/PkgDescription.tex @@ -1,5 +1,6 @@ \begin{ccPkgDescription}{dD Range and Segment Trees \label{Pkg:RangeSegmentTreesD}} +\ccHowToCite{cgal:n-rstd-06} \ccPkgSummary{Range and segment trees allow to perform window queries on point sets, and to enumerate all ranges enclosing a query point. The provided data structures are static and they are optimized for fast queries.} diff --git a/Spatial_searching/doc_tex/Spatial_searching/PkgDescription.tex b/Spatial_searching/doc_tex/Spatial_searching/PkgDescription.tex new file mode 100644 index 00000000000..747ae5c7f35 --- /dev/null +++ b/Spatial_searching/doc_tex/Spatial_searching/PkgDescription.tex @@ -0,0 +1,15 @@ + +\begin{ccPkgDescription}{dD Spatial Searching\label{Pkg:SpatialSearchingD}} +\ccHowToCite{cgal:tf-ssd-06} +\ccPkgSummary{ + +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.} + +%\ccPkgDependsOn{} +\ccPkgIntroducedInCGAL{3.1} +\ccPkgLicense{\ccLicenseQPL} +\end{ccPkgDescription} diff --git a/Spatial_searching/doc_tex/Spatial_searching/main.tex b/Spatial_searching/doc_tex/Spatial_searching/main.tex index 5c19a96a9c8..510fc638a7a 100644 --- a/Spatial_searching/doc_tex/Spatial_searching/main.tex +++ b/Spatial_searching/doc_tex/Spatial_searching/main.tex @@ -1,5 +1,5 @@ -\ccUserChapter{dD Spatial Searching} -\label{ChapterUserSpatialSearching} +\ccUserChapter{dD Spatial Searching\label{ChapterUserSpatialSearching}} +\input{Spatial_searching/PkgDescription.tex} \input{Spatial_searching/intro.tex} %% EOF diff --git a/Stream_lines_2/doc_tex/Stream_lines_2/PkgDescription.tex b/Stream_lines_2/doc_tex/Stream_lines_2/PkgDescription.tex index fca13832632..822a872648a 100644 --- a/Stream_lines_2/doc_tex/Stream_lines_2/PkgDescription.tex +++ b/Stream_lines_2/doc_tex/Stream_lines_2/PkgDescription.tex @@ -1,5 +1,6 @@ \begin{ccPkgDescription}{2D Placement of Streamlines\label{Pkg:PlacementOfStreamlines2}} +\ccHowToCite{cgal:m-ps-06} \ccPkgSummary{ Visualizing vector fields is important for many application domains. A good way to do it is to generate streamlines that describe the flow diff --git a/Subdivision_method_3/doc_tex/Subdivision_method_3/PkgDescription.tex b/Subdivision_method_3/doc_tex/Subdivision_method_3/PkgDescription.tex index de9705c8c00..97ec1e99cba 100644 --- a/Subdivision_method_3/doc_tex/Subdivision_method_3/PkgDescription.tex +++ b/Subdivision_method_3/doc_tex/Subdivision_method_3/PkgDescription.tex @@ -1,5 +1,6 @@ \begin{ccPkgDescription}{3D Surface Subdivision Methods\label{Pkg:SurfaceSubdivisionMethods3}} +\ccHowToCite{cgal:s-ssm2-06} \ccPkgSummary{ Subdivision methods recursively refine a control mesh and generate points approximating the limit surface. This package consists of four diff --git a/Surface_mesh_parameterization/doc_tex/Surface_mesh_parameterization/PkgDescription.tex b/Surface_mesh_parameterization/doc_tex/Surface_mesh_parameterization/PkgDescription.tex index 44b53df6c04..e026f7e2159 100644 --- a/Surface_mesh_parameterization/doc_tex/Surface_mesh_parameterization/PkgDescription.tex +++ b/Surface_mesh_parameterization/doc_tex/Surface_mesh_parameterization/PkgDescription.tex @@ -1,4 +1,5 @@ \begin{ccPkgDescription}{Planar Parameterization of Triangulated Surface Meshes\label{Pkg:SurfaceParameterization}} +\ccHowToCite{cgal:sal-pptsm2-06} \ccPkgSummary{Parameterizing a surface amounts to finding a one-to-one mapping from a suitable domain to the surface. In this package, we focus on triangulated surfaces that are homeomorphic to a disk and on piecewise diff --git a/Surface_mesher/doc_tex/Surface_mesher/PkgDescription.tex b/Surface_mesher/doc_tex/Surface_mesher/PkgDescription.tex index 8174167b2cb..3b1ee53a054 100644 --- a/Surface_mesher/doc_tex/Surface_mesher/PkgDescription.tex +++ b/Surface_mesher/doc_tex/Surface_mesher/PkgDescription.tex @@ -1,5 +1,6 @@ \begin{ccPkgDescription}{3D Surface Mesher\label{Pkg:SurfaceMesher3}} +\ccHowToCite{cgal:ry-sm2-06} \ccPkgSummary{ This package provides functions to generate surface meshes that interpolate