From 082cf96409bc3f2b6a3516b677e5f318988bcbed Mon Sep 17 00:00:00 2001 From: Jane Tournois Date: Fri, 3 Apr 2020 15:06:18 +0200 Subject: [PATCH] add segment cell iterator description in the doc --- Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_3.h | 5 +++++ 1 file changed, 5 insertions(+) diff --git a/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_3.h b/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_3.h index 120a4cf619b..c6e397aebc5 100644 --- a/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_3.h +++ b/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_3.h @@ -1303,6 +1303,11 @@ Points points() const; /*!\name Segment Cell Iterator \cgalModifBegin The triangulation defines an iterator that visits cells intersected by a line segment. +Segment Cell Iterator iterates over a sequence of cells which union contains the segment `[s,t]`. +The sequence of cells is "minimal" (removing any cell would make the union of the +renaming cells not entirely containing `[s,t]`) and sorted along `[s,t]`. +The "minimality" of the sequence implies that in degenerate cases, +only one cell incident to the traversed simplex will be reported. The cells visited form a facet-connected region containing both source and target points of the line segment `[s,t]`. Each cell falls within one or more of the following categories: