diff --git a/April11/FirstOfApril.html b/April11/FirstOfApril.html index 2dc547d12..b3c55aedf 100644 --- a/April11/FirstOfApril.html +++ b/April11/FirstOfApril.html @@ -24,7 +24,7 @@
Home | Intranet
Overview
Installation Guide (4.4)
Online Manual (4.5-beta1)
Tutorials
All Manuals
Download
License
The CGAL Philosophy
Acknowledging CGAL
Work in Progress
Release History
FAQ -
CGAL on Windows
Supported Platforms
Reporting Bugs
Mailing Lists/Forums
FAQ +
People
Getting Involved
Rules
Partners and Funding
Videos
Events
Classes
Projects Using CGAL
3rd Party Software
Related Links
-The goal of the CGAL Open Source Project is to provide -easy access to efficient and reliable geometric algorithms +The goal of the CGAL Open Source Project is to provide +easy access to efficient and reliable geometric algorithms in the form of a C++ library. CGAL is used in various areas needing geometric computation, such as: computer graphics, scientific visualization, computer aided design and modeling, geographic information systems, molecular biology, medical imaging, robotics and motion planning, mesh generation, numerical methods... -More on the projects using CGAL web page.
The CGAL Project uses Web 3.14 technology to make CGAL users more productive, and this far beyond just getting the programming job done. @@ -194,7 +194,7 @@
The CGAL Project enters a new era. So far you could only reach us via the cgal-discuss mailing list.
In the next days we will open the CGAL IRC channel. Additionally, you will see the skype online status of the -CGAL developers listed on the Project Members page. Speak to them +CGAL developers listed on the Project Members page. Speak to them directly when you hit a bug, and even show them the stacktrace in Visual Sudio using skype screensharing.
CGAL::AABB_tree tree(faces(surface_mesh));
CGAL::Surface_mesh_deformation(body);
VD = CGAL::make_voronoi(segments);
CGAL::Affine_transformation_3();
CGAL::Image_2("clover.png");
CGAL::AABB_tree tree(faces(surface));
CGAL::parallel::make_periodic_mesh_3(S);
CGAL::sibson_c1_interpolation_square(p, N);
CGAL::just_do_it(heat_me_up);
CGAL::just_do_it(surface_mesh);
CGAL::just_do_it(first_second_third);
CGAL::make_periodic_mesh(foam);
CGAL::just_do_it(mesh);
CGAL::join(HighAchievers);
CGAL::listen(triangles);
CGAL::speak(points);
CGAL::Arrangement_2();
CGAL::AABB_tree tree(faces(ape_mesh));
CGAL::Heat_method_3::estimate_geodesic_distances();
CGAL::connected_components(doodles));
CGAL::Classification::classify(experiences);
CGAL::Periodic_tet_mesh mesh = CGAL::make_periodic_mesh();
CGAL::Dieudonne_operator(statue, container);
CGAL::make_Bourbaki_graph();
CGAL::make_Leray_triangulation();
CGAL::Seifert_loop(faces(surface_mesh));
CGAL::Cartan_method_3::estimate_hyperbolic_distances();
We work hard to make all the above a reality - so far it is only an april joke. -It even came with a gallery.
Automatic Knit Model Generation for Adidas
This April joke came with a gallery.
Before sending a bug-report, you should check the -FAQ and +FAQ and our issue tracker on GitHub, where your issue might have already been answered or reported.
If you are using an old version of CGAL, your problem may have already been solved in a more recent release. Please try your program with -the latest release. +the latest release.
Bug reports should be made on our GitHub issue tracker @@ -32,7 +32,7 @@
Algorithms in CGAL are currently essentially sequential. Some work has begun on parallelizing the computation of Delaunay triangulations, but a lot remains to be done, in various areas. Students can propose important areas that they think they could parallelize.
+
A simple point-set is topologically equivalent to a disc, and has a well-defined interior and exterior. Automatically "fixing" corrupted data, that is, converting @@ -431,7 +431,7 @@
The plane-sweep algorithm is a fundamental concept in Computational Geometry. It plays a central role in the algorithmic study of arrangements. The famous plane-sweep @@ -596,7 +596,7 @@
The arrangement package includes several classes (more precisely, +
The arrangement package includes several classes (more precisely, class templates parameterised by an arrangement class) that model the ArrangementPointLocation_2 concept. Namely, they all have a member function called diff --git a/index.html b/index.html index 2e1ea47d5..b2af9ee1e 100644 --- a/index.html +++ b/index.html @@ -122,7 +122,7 @@