update text

CGAL_ipelets/demo/CGAL_ipelets/alpha_shapes.cpp

@@ -81,7 +81,7 @@ void ASphapeIpelet::protected_run(int fn)
 
 
   if (pt_list.empty() and cir_list.empty()) {
-    print_error_message("No circle or point selected");
+    print_error_message("No circle nor point selected");
     return;
   }
 

CGAL_ipelets/demo/CGAL_ipelets/bbox_restriction.cpp

@@ -32,7 +32,7 @@ namespace CGAL_bbox_restriction{
 typedef CGAL::Exact_predicates_inexact_constructions_kernel               Kernel;  
   
 const std::string sublabel[] ={
-  "Bbox restriction", "Help"
+  "Bounding box restriction", "Help"
 };
 
 const std::string helpmsg[] = {
@@ -43,7 +43,7 @@ struct hilbertsortIpelet
   : CGAL::Ipelet_base<Kernel,2>
 {
   hilbertsortIpelet()
-    : CGAL::Ipelet_base<Kernel,2>("Bbox restriction",sublabel, helpmsg) {}
+    : CGAL::Ipelet_base<Kernel,2>("Bounding box restriction",sublabel, helpmsg) {}
 
   void protected_run(int);
 };
@@ -74,7 +74,7 @@ void hilbertsortIpelet::protected_run(int fn)
 
   
   if (pt_list.size()<2) {
-    print_error_message("No points to define a bounding box");
+    print_error_message("No point selected to define a bounding box");
     return;
   }
   

CGAL_ipelets/demo/CGAL_ipelets/diagrams.cpp

@@ -53,10 +53,10 @@ const std::string sublabel[] = {
 };
 
 const std::string helpmsg[] = {
-  "Draw Voronoi diagram of a set of points and segments, circles and circle arcs",
-  "Draw the segment Voronoi diagram except the edges of the diagram corresponding to a segment and its endpoints",
-  "Draw a Power diagram of a set of weighted points (circles, points)",
-  "Draw Apollonius diagram of a set of circles"
+  "Draw the Voronoi diagram of a set of points and segments, circles and circle arcs",
+  "Draw the segment Voronoi diagram except the bisectors between a segment and its own endpoints",
+  "Draw the Power diagram of a set of weighted points (circles, points)",
+  "Draw the Apollonius diagram of a set of circles"
 };
 
 class diagrammeIpelet 

CGAL_ipelets/demo/CGAL_ipelets/hilbert_sort.cpp

@@ -34,7 +34,7 @@ const std::string sublabel[] ={
 };
 
 const std::string helpmsg[] = {
-  "Sorts the points along a Hilbert curve"
+  "Sort the points along a Hilbert curve"
 };
 
 struct hilbertsortIpelet
@@ -61,7 +61,7 @@ void hilbertsortIpelet::protected_run(int fn)
   read_active_objects( CGAL::dispatch_or_drop_output<Point_2>( std::back_inserter(pt_list) ) );
 
   if (pt_list.empty()) {
-    print_error_message("No marks selected");
+    print_error_message("No mark selected");
     return;
   }
   

CGAL_ipelets/demo/CGAL_ipelets/hull.cpp

@@ -105,7 +105,7 @@ void enveloppeIpelet::protected_run(int fn)
      );
       
       if (pt_list.empty() && cir_list.empty()) {
-        print_error_message("No marks nor circles nor segments selected");
+        print_error_message("No mark nor circle nor segment selected");
         return;
       }
 

CGAL_ipelets/demo/CGAL_ipelets/mesh_2.cpp

@@ -78,7 +78,7 @@ void IpeletMesh2::protected_run(int fn)
     );
 
   if (pt_list.empty() and sg_list.empty() and pol_list.empty()) {
-    print_error_message("No marks selected");
+    print_error_message("No mark selected");
     return;
   }
 

CGAL_ipelets/demo/CGAL_ipelets/multi_delaunay.cpp

@@ -87,7 +87,7 @@ void MdelaunayIpelet::protected_run(int fn)
   Iso_rectangle_2 bbox=read_active_objects( CGAL::dispatch_or_drop_output<Point_2>( std::back_inserter(pt_list) ) );  
   
   if (pt_list.empty()){
-    print_error_message("No marks selected");
+    print_error_message("No mark selected");
     return;
   }
   

CGAL_ipelets/demo/CGAL_ipelets/multi_regular.cpp

@@ -42,7 +42,7 @@ const std::string sublabel[] = {
 };
 
 const std::string hlpmsg[] = {
-  "Generate k-th regular triangulation and k-th dual Voronoi diagram. Note : k must be smaller than the number of input circles."
+  "Generate k-th regular triangulation and k-th dual Power diagram. Note : k must be smaller than the number of input circles."
 };
 
 class MregularIpelet 
@@ -78,7 +78,7 @@ void MregularIpelet::protected_run(int fn)
     );  
   
   if (!input_wpt.size()) {
-    print_error_message("No circles selected");
+    print_error_message("No circle selected");
     return;
   }
   

CGAL_ipelets/demo/CGAL_ipelets/partition.cpp

@@ -33,8 +33,8 @@ const std::string Slab[] = {
 
 const std::string Hmsg[] = {
   "Y monotonic decomposition of a polygon",
-  "Approximation of convex decomposition of a polygon using Greene algorithm",
-  "Approximation of convex decomposition of a polygon using Hertel and Mehlhorn algorithm",
+  "Approximation of convex decomposition of a polygon using Greene's algorithm",
+  "Approximation of convex decomposition of a polygon using Hertel and Mehlhorn's algorithm",
   "Optimal convex decomposition of a polygon"
 };
 

CGAL_ipelets/demo/CGAL_ipelets/pca.cpp

@@ -116,7 +116,7 @@ void pcaIpelet::protected_run(int fn)
       linear_least_squares_fitting_2(sg_list.begin(),sg_list.end(),line,centroid,CGAL::Dimension_tag<1>());
       break;  
     default:
-      print_error_message("Please selected a set of points or segments or triangles or circles");
+      print_error_message("Please select a set of points or segments or triangles or circles");
       return;    
   }
   

CGAL_ipelets/demo/CGAL_ipelets/simple_triangulation.cpp

@@ -40,7 +40,7 @@ void Triangulation_ipelet::protected_run(int fn)
     );
     
     if (pt_lst.empty()) {
-      print_error_message("No marks selected");
+      print_error_message("No mark selected");
       return;
     }
     

CGAL_ipelets/demo/CGAL_ipelets/triangulation.cpp

@@ -93,7 +93,7 @@ void triangulationIpelet::protected_run(int fn)
   switch(fn){
     case 0://Delaunay
       if (pt_list.empty()) {
-        print_error_message("No marks selected");
+        print_error_message("No mark selected");
         return;
       }
       dt.insert(pt_list.begin(),pt_list.end());
@@ -103,7 +103,7 @@ void triangulationIpelet::protected_run(int fn)
     case 3:
     case 1://Constraint delaunay
       if (pt_list.empty() && sg_list.empty()){
-        print_error_message("No marks or polygons selected");
+        print_error_message("No mark nor polygon selected");
       }
       //insert points
       Cdt.insert(pt_list.begin(),pt_list.end());
@@ -120,7 +120,7 @@ void triangulationIpelet::protected_run(int fn)
       }
       
       if (!Cdt.number_of_vertices()) {
-        print_error_message("No marks or polygons selected");
+        print_error_message("No mark nor polygon selected");
         return;
       }
       
@@ -130,7 +130,7 @@ void triangulationIpelet::protected_run(int fn)
     break;
     case 4:      //regular
       if (pt_list.empty() && cir_list.empty()){
-        print_error_message("No circles or marks selected");
+        print_error_message("No circle nor mark selected");
       }
       //insert points
       for (std::list<Point_2>::iterator it_pt=pt_list.begin();it_pt!=pt_list.end();++it_pt)

CGAL_ipelets/include/CGAL/CGAL_Ipelet_base.h

@@ -82,7 +82,7 @@ namespace CGAL{
         protected_run(i);
       }
       catch(...){
-        helper->MessageBox("Error : Save your page in a file and submit it to \n https://gforge.inria.fr/tracker/?atid=3253&group_id=801&func=browse","OK",NULL,NULL);
+        helper->MessageBox("Error : Save your page in a file and submit it to \n http://www.cgal.org/bug_report.html","OK",NULL,NULL);
       }
     };