From 5f5608eb4cc9ae570b2912d39afc3b6022714a78 Mon Sep 17 00:00:00 2001 From: Sven Oesau Date: Thu, 20 Nov 2025 12:25:50 +0100 Subject: [PATCH] added reference --- .../Convex_decomposition_3/Convex_decomposition_3.txt | 2 +- Documentation/doc/biblio/cgal_manual.bib | 10 ++++++++++ .../Surface_mesh_decomposition/license.txt | 2 +- 3 files changed, 12 insertions(+), 2 deletions(-) diff --git a/Convex_decomposition_3/doc/Convex_decomposition_3/Convex_decomposition_3.txt b/Convex_decomposition_3/doc/Convex_decomposition_3/Convex_decomposition_3.txt index bfd47c38e97..af1dfe4f7cf 100644 --- a/Convex_decomposition_3/doc/Convex_decomposition_3/Convex_decomposition_3.txt +++ b/Convex_decomposition_3/doc/Convex_decomposition_3/Convex_decomposition_3.txt @@ -101,7 +101,7 @@ support the use of extended kernels in the convex decomposition. Approximate convex decomposition of the elephant.off model.\n From left to right: 1. input mesh 2. 5 convex volumes 3. 8 convex volumes 4. 12 convex volumes \cgalFigureCaptionEnd -The H-VACD, introduced by computes a set of convex volumes that fit the polyhedron. Contrary to the decomposition of the polyhedron into convex parts, the convex volumes cover the polyhedron, but also include additional volume outside of the polyhedron. +The H-VACD method \cgalCite{cgal:mamou2016volumetric}, "Hierarchical volumetrix approximate convex decomposition", computes a set of convex volumes that fit the polyhedron. Contrary to the decomposition of the polyhedron into convex parts, the convex volumes cover the polyhedron, but also include additional volume outside of it. A sufficiently tight enclosure of the polyhedron by several convex volumes allows fast intersection calculation and collision detection among polyhedra while offering a non-hierachical approach and may thus be easier to use in a parallel setting. The resulting set of convex volumes minimizes the volume between their union and the polyhedron while fully including the input polyhedron. While the optimal solution with `n` convex hulls that cover the polydron with the smallest additional volume remains NP-hard, this method provides a fast error-driven approximation. diff --git a/Documentation/doc/biblio/cgal_manual.bib b/Documentation/doc/biblio/cgal_manual.bib index a16cfe0015f..4813821987b 100644 --- a/Documentation/doc/biblio/cgal_manual.bib +++ b/Documentation/doc/biblio/cgal_manual.bib @@ -3516,6 +3516,16 @@ pages = "207--221" year = {2015} } +@article{cgal:mamou2016volumetric, + title={Volumetric hierarchical approximate convex decomposition}, + author={Mamou, Khaled and Lengyel, E and Peters, A}, + journal={Game engine gems}, + volume={3}, + pages={141--158}, + year={2016}, + publisher={AK Peters} +} + % ---------------------------------------------------------------------------- % END OF BIBFILE % ---------------------------------------------------------------------------- diff --git a/Surface_mesh_decomposition/package_info/Surface_mesh_decomposition/license.txt b/Surface_mesh_decomposition/package_info/Surface_mesh_decomposition/license.txt index ba1f6f2dc96..8bb8efcb72b 100644 --- a/Surface_mesh_decomposition/package_info/Surface_mesh_decomposition/license.txt +++ b/Surface_mesh_decomposition/package_info/Surface_mesh_decomposition/license.txt @@ -1 +1 @@ -GPL (v3 or later) \ No newline at end of file +GPL (v3 or later)