From 381cb4edf83e11b7389826a52171caedf098d67f Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= Date: Thu, 26 Mar 2015 21:43:00 +0100 Subject: [PATCH] rephrase citation --- .../include/CGAL/Shape_detection_3/Efficient_RANSAC.h | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) diff --git a/Point_set_shape_detection_3/include/CGAL/Shape_detection_3/Efficient_RANSAC.h b/Point_set_shape_detection_3/include/CGAL/Shape_detection_3/Efficient_RANSAC.h index 0fbcaae2141..143d4072f2a 100644 --- a/Point_set_shape_detection_3/include/CGAL/Shape_detection_3/Efficient_RANSAC.h +++ b/Point_set_shape_detection_3/include/CGAL/Shape_detection_3/Efficient_RANSAC.h @@ -99,8 +99,7 @@ namespace CGAL { Given a point set in 3D space with unoriented normals, sampled on surfaces, this classes enables to detect subset of connected points lying on the surface of primitive shapes. Each input point is assigned to either none or at most one detected primitive -shape. The implementation follows the algorithm published by Schnabel et al. -in 2007 \cgalCite{Schnabel07}. +shape. The implementation follows \cgalCite{Schnabel07}. \tparam ERTraits Efficient_RANSAC_traits