From 71a89e94ca77628b23c9e7c3d41371053dfeb602 Mon Sep 17 00:00:00 2001 From: Efi Fogel Date: Wed, 28 Aug 2024 20:58:45 +0300 Subject: [PATCH] Changed prefix of concept names Arrangement... => Aos... --- Surface_sweep_2/doc/Surface_sweep_2/Surface_sweep_2.txt | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/Surface_sweep_2/doc/Surface_sweep_2/Surface_sweep_2.txt b/Surface_sweep_2/doc/Surface_sweep_2/Surface_sweep_2.txt index 097490409ba1..9e16de9d1b99 100644 --- a/Surface_sweep_2/doc/Surface_sweep_2/Surface_sweep_2.txt +++ b/Surface_sweep_2/doc/Surface_sweep_2/Surface_sweep_2.txt @@ -33,7 +33,7 @@ all degenerate cases, including overlapping curves, vertical segments, and tangency between curves. The robustness of the algorithm is guaranteed if the functions are instantiated with a traits class that employs certified computations. This traits class must be a model of -the `ArrangementTraits_2` concept - see the Chapter \ref +the `AosTraits_2` concept - see the Chapter \ref chapterArrangement_on_surface_2 "2D Arrangements" for more details. The complexity of the surface-sweep algorithm is \cgalBigO{(n +