From 69ce2c1c7c3b5d3f04a64c403e1df7153b7d08aa Mon Sep 17 00:00:00 2001 From: Andreas Fabri Date: Wed, 13 Mar 2024 14:48:54 +0100 Subject: [PATCH] Add 2D to the chapter title --- AABB_tree/doc/AABB_tree/Doxyfile.in | 5 +---- AABB_tree/doc/AABB_tree/PackageDescription.txt | 2 +- AABB_tree/doc/AABB_tree/aabb_tree.txt | 2 +- 3 files changed, 3 insertions(+), 6 deletions(-) diff --git a/AABB_tree/doc/AABB_tree/Doxyfile.in b/AABB_tree/doc/AABB_tree/Doxyfile.in index b626c95c2da..8f87e4f9202 100644 --- a/AABB_tree/doc/AABB_tree/Doxyfile.in +++ b/AABB_tree/doc/AABB_tree/Doxyfile.in @@ -1,10 +1,7 @@ @INCLUDE = ${CGAL_DOC_PACKAGE_DEFAULTS} -PROJECT_NAME = "CGAL ${CGAL_DOC_VERSION} - 3D Fast Intersection and Distance Computation (AABB Tree)" +PROJECT_NAME = "CGAL ${CGAL_DOC_VERSION} - 2D and 3D Fast Intersection and Distance Computation (AABB Tree)" EXTRACT_ALL = false HIDE_UNDOC_MEMBERS = true HIDE_UNDOC_CLASSES = true - - - diff --git a/AABB_tree/doc/AABB_tree/PackageDescription.txt b/AABB_tree/doc/AABB_tree/PackageDescription.txt index 2752b56af5d..3e78bb5404b 100644 --- a/AABB_tree/doc/AABB_tree/PackageDescription.txt +++ b/AABB_tree/doc/AABB_tree/PackageDescription.txt @@ -9,7 +9,7 @@ \cgalPkgPicture{aabb-teaser-thumb.png} \cgalPkgSummaryBegin \cgalPkgAuthors{Pierre Alliez, Stéphane Tayeb, and Camille Wormser} -\cgalPkgDesc{The AABB (axis-aligned bounding box) tree component offers a static data structure and algorithms to perform efficient intersection and distance queries on sets of finite 3D geometric objects.} +\cgalPkgDesc{The AABB (axis-aligned bounding box) tree component offers a static data structure and algorithms to perform efficient intersection and distance queries on sets of finite 2D and 3D geometric objects.} \cgalPkgManuals{Chapter_Fast_Intersection_and_Distance_Computation,PkgAABBTreeRef} \cgalPkgSummaryEnd \cgalPkgShortInfoBegin diff --git a/AABB_tree/doc/AABB_tree/aabb_tree.txt b/AABB_tree/doc/AABB_tree/aabb_tree.txt index ec82d0c6d37..031355126cd 100644 --- a/AABB_tree/doc/AABB_tree/aabb_tree.txt +++ b/AABB_tree/doc/AABB_tree/aabb_tree.txt @@ -12,7 +12,7 @@ namespace CGAL { The AABB tree component offers a static data structure and algorithms to perform efficient intersection and distance queries against sets of -finite 3D geometric objects. The set of geometric objects stored in +finite 2D or 3D geometric objects. The set of geometric objects stored in the data structure can be queried for intersection detection, intersection computation and distance. The intersection queries can be of any type, provided that the corresponding intersection predicates