From 1cf3c2fe912aff4f709b1455eb04531cdeb01f21 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= Date: Tue, 16 Dec 2014 11:06:48 +0100 Subject: [PATCH] cosmetic --- .../doc/Point_set_processing_3/Point_set_processing_3.txt | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/Point_set_processing_3/doc/Point_set_processing_3/Point_set_processing_3.txt b/Point_set_processing_3/doc/Point_set_processing_3/Point_set_processing_3.txt index c22ed7ba4c2..45fea441834 100644 --- a/Point_set_processing_3/doc/Point_set_processing_3/Point_set_processing_3.txt +++ b/Point_set_processing_3/doc/Point_set_processing_3/Point_set_processing_3.txt @@ -194,7 +194,7 @@ projecting each point onto a smooth parametric surface patch Function `bilateral_smooth_point_set()` smooths the input point set by iteratively projecting each point onto the implicit surface patch fitted over its `k` nearest neighbors. Bilateral projection preserves sharp features according to the normal (gradient) information. -Normals are thus required as input. See section 4 in \cgalCite{ear-2013}. +Normals are thus required as input. For more details, see section 4 of \cgalCite{ear-2013}. \subsection Point_set_processing_3Example_5 Jet smoothing example @@ -268,7 +268,7 @@ normals: \section Point_set_processing_3Upsampling Upsampling The function `edge_aware_upsample_point_set()` generates a denser point set from an input point set. This has applications in point-based rendering, hole filling, and sparse surface reconstruction. -The algorithm can progressively upsample the point set while approaching the edge singularities, see \cgalCite{ear-2013} for more detail. +The algorithm can progressively upsample the point set while approaching the edge singularities. See \cgalCite{ear-2013} for more details. \subsection Point_set_processing_3Example_8 Example