songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Distance, Generator, HDS, Convex_hull, Polyhedron, PCA

This commit is contained in:
Andreas Fabri 2019-02-14 10:39:56 +01:00
parent 7a84f58c0d
commit e989b87dfe
28 changed files with 88 additions and 108 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
Convex_hull_3/test/Convex_hull_3/degeneracy_test.cpp
View File

@ -20,7 +20,7 @@
// ============================================================================
#include <CGAL/Cartesian.h>
#include <CGAL/Simple_cartesian.h>
#include <CGAL/Polyhedron_3.h>
#include <CGAL/Convex_hull_2/ch_assertions.h>
#include <CGAL/convex_hull_3.h>
@ -28,7 +28,7 @@
#include <fstream>
typedef double NumberType;
typedef CGAL::Cartesian<NumberType> Kernel;
typedef CGAL::Simple_cartesian<NumberType> Kernel;
typedef CGAL::Polyhedron_3<Kernel> Polyhedron;
typedef Kernel::Point_3 Point_3;

4
Convex_hull_3/test/Convex_hull_3/quickhull_degenerate_test_3.cpp
View File

@ -1,5 +1,5 @@
#include <CGAL/Exact_rational.h>
#include <CGAL/Cartesian.h>
#include <CGAL/Simple_cartesian.h>
#include <CGAL/Polyhedron_3.h>
#include <fstream>
@ -12,7 +12,7 @@
typedef CGAL::Exact_rational Exact_rational;
typedef CGAL::Cartesian< Exact_rational > R;
typedef CGAL::Simple_cartesian<Exact_rational> R;
typedef CGAL::Convex_hull_traits_3<R> Traits;
typedef Traits::Polygon_mesh Polyhedron_3;

10
Distance_2/test/Distance_2/test_distance_2.cpp
View File

@ -4,14 +4,8 @@
#undef NDEBUG //this testsuite requires NDEBUG to be not defined
#endif
#include <CGAL/Line_2.h>
#include <CGAL/Point_2.h>
#include <CGAL/Segment_2.h>
#include <CGAL/Ray_2.h>
#include <CGAL/Triangle_2.h>
#include <CGAL/Iso_rectangle_2.h>
#include <CGAL/Cartesian.h>
#include <CGAL/Simple_cartesian.h>
#include <CGAL/Homogeneous.h>
#include <vector>
@ -296,7 +290,7 @@ struct Test {
int main()
{
Test< CGAL::Cartesian<double> >().run();
Test< CGAL::Simple_cartesian<double> >().run();
Test< CGAL::Homogeneous<double> >().run();
// TODO : test more kernels.
}

12
Distance_3/test/Distance_3/test_distance_3.cpp
View File

@ -4,15 +4,7 @@
#undef NDEBUG //this testsuite requires NDEBUG to be not defined
#endif
#include <CGAL/Object.h>
#include <CGAL/Line_3.h>
#include <CGAL/Point_3.h>
#include <CGAL/Segment_3.h>
#include <CGAL/Ray_3.h>
#include <CGAL/Triangle_3.h>
#include <CGAL/Iso_cuboid_3.h>
#include <CGAL/Cartesian.h>
#include <CGAL/Simple_cartesian.h>
#include <CGAL/Homogeneous.h>
#include <vector>
@ -253,7 +245,7 @@ struct Test {
int main()
{
Test< CGAL::Cartesian<double> >().run();
Test< CGAL::Simple_cartesian<double> >().run();
Test< CGAL::Homogeneous<double> >().run();
// TODO : test more kernels.
}

1
Generator/test/Generator/generic_random_test.cpp
View File

@ -1,5 +1,4 @@
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#include <CGAL/Simple_cartesian.h>
#include <CGAL/Mesh_complex_3_in_triangulation_3.h>
#include <CGAL/Mesh_criteria_3.h>

4
Generator/test/Generator/random_poly_test.cpp
View File

@ -22,14 +22,14 @@
// Random Simple Polygons: Test Program
// ============================================================================
#include <CGAL/Cartesian.h>
#include <CGAL/Simple_cartesian.h>
#include <CGAL/Homogeneous.h>
#include <CGAL/point_generators_2.h>
#include <CGAL/random_polygon_2.h>
#include <CGAL/Polygon_2.h>
#include <list>
typedef CGAL::Cartesian< double > CR;
typedef CGAL::Simple_cartesian< double > CR;
typedef CGAL::Point_2< CR > CPoint_2;
typedef std::list<CPoint_2> CContainer;
typedef CGAL::Polygon_2<CR, CContainer> CPolygon_2;

6
Generator/test/Generator/rcs_test.cpp
View File

@ -23,7 +23,7 @@
// Random Convex Point Sets: Test Program
// ============================================================================
#include <CGAL/Cartesian.h>
#include <CGAL/Simple_cartesian.h>
#include <CGAL/Point_2.h>
#include <CGAL/Polygon_2.h>
#include <CGAL/point_generators_2.h>
@ -34,7 +34,7 @@
using std::vector;
using std::back_inserter;
using CGAL::Cartesian;
using CGAL::Simple_cartesian;
using CGAL::Creator_uniform_2;
using CGAL::Random_points_in_square_2;
using CGAL::set_pretty_mode;
@ -44,7 +44,7 @@ using CGAL::random_convex_set_2;
int
main( )
{
typedef Cartesian< double > R;
typedef Simple_cartesian< double > R;
typedef CGAL::Point_2< R > Point_2;
typedef vector< Point_2 > Cont;
typedef CGAL::Polygon_2< R, Cont > Polygon_2;

6
Generator/test/Generator/test_generators.cpp
View File

@ -29,10 +29,8 @@
#include <cstddef>
#include <vector>
#include <algorithm>
#include <CGAL/Cartesian.h>
#include <CGAL/Simple_cartesian.h>
#include <CGAL/Cartesian_d.h>
#include <CGAL/Point_2.h>
#include <CGAL/Point_3.h>
#include <CGAL/point_generators_2.h>
#include <CGAL/point_generators_3.h>
#include <CGAL/point_generators_d.h>
@ -42,7 +40,7 @@
using namespace CGAL;
typedef Cartesian<double> R;
typedef Simple_cartesian<double> R;
typedef CGAL::Cartesian_d<double> Kd;

5
Generator/test/Generator/test_tetrahedron_3.cpp
View File

@ -3,12 +3,11 @@
#include <CGAL/Random.h>
#include <CGAL/algorithm.h>
#include <CGAL/double.h>
#include <CGAL/Triangle_3.h>
#include <CGAL/Cartesian.h>
#include <CGAL/Simple_cartesian.h>
#include <cassert>
typedef double RT;
typedef CGAL::Cartesian<RT> K;
typedef CGAL::Simple_cartesian<RT> K;
typedef K::Point_3 Point_3;
typedef K::Vector_3 Vector_3;
typedef K::Tetrahedron_3 Tetrahedron_3;

1
Generator/test/Generator/test_triangle_3.cpp
View File

@ -3,7 +3,6 @@
#include <CGAL/Random.h>
#include <CGAL/algorithm.h>
#include <CGAL/double.h>
#include <CGAL/Triangle_3.h>
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#include <cassert>

4
HalfedgeDS/test/HalfedgeDS/test_hds.cpp
View File

@ -26,7 +26,7 @@
// ============================================================================
#include <CGAL/Cartesian.h>
#include <CGAL/Simple_cartesian.h>
#include <CGAL/HalfedgeDS_default.h>
#include <CGAL/HalfedgeDS_min_items.h>
#include <CGAL/Polyhedron_items_3.h>
@ -34,7 +34,7 @@
#include <cstddef>
#include <cassert>
typedef CGAL::Cartesian<double> Kernel;
typedef CGAL::Simple_cartesian<double> Kernel;
struct Dummy_traits_3 {
typedef Kernel::Point_3 Point_3;
typedef Kernel::Plane_3 Plane_3;

4
HalfedgeDS/test/HalfedgeDS/test_hds_decorator.cpp
View File

@ -26,14 +26,14 @@
// ============================================================================
#include <CGAL/Cartesian.h>
#include <CGAL/Simple_cartesian.h>
#include <CGAL/HalfedgeDS_default.h>
#include <CGAL/Polyhedron_items_3.h>
#include <CGAL/HalfedgeDS_decorator.h>
#include <cassert>
typedef CGAL::Cartesian<double> Kernel;
typedef CGAL::Simple_cartesian<double> Kernel;
struct Dummy_traits_2 {
typedef Kernel::Point_2 Point_2;
};

1
Hash_map/test/Hash_map/Unique_hash_map_test.cpp
View File

@ -1,4 +1,3 @@
#include <CGAL/Cartesian.h>
#include <list>
#include <CGAL/Unique_hash_map.h>
#include <CGAL/test_macros.h>

8
Polyhedron/test/Polyhedron/test_polyhedron.cpp
View File

@ -26,7 +26,7 @@
// ============================================================================
#include <CGAL/Cartesian.h>
#include <CGAL/Simple_cartesian.h>
#include <CGAL/Polyhedron_3.h>
#include <CGAL/HalfedgeDS_vector.h>
#include <CGAL/HalfedgeDS_list.h>
@ -276,8 +276,8 @@ struct Test_facet_modifier : public CGAL::Modifier_base<HDS>
};
void test_Polyhedron() {
typedef CGAL::Cartesian<double> Kernel;
typedef CGAL::Cartesian<int> KernelI;
typedef CGAL::Simple_cartesian<double> Kernel;
typedef CGAL::Simple_cartesian<int> KernelI;
typedef CGAL::Point_3<Kernel> Point;
typedef CGAL::Plane_3<Kernel> Plane;
typedef CGAL::Polyhedron_traits_3<Kernel> Traits;
@ -1116,7 +1116,7 @@ void test_Polyhedron() {
}
void test_min_Polyhedron() {
typedef CGAL::Cartesian<double> Kernel;
typedef CGAL::Simple_cartesian<double> Kernel;
typedef CGAL::Point_3<Kernel> Point;
typedef CGAL::Polyhedron_traits_3<Kernel> Traits;
typedef CGAL::Polyhedron_3<Traits,

4
Polyhedron_IO/test/Polyhedron_IO/test_polyhedron_io.cpp
View File

@ -25,7 +25,7 @@
// ============================================================================
#include <CGAL/Cartesian.h>
#include <CGAL/Simple_cartesian.h>
#include <CGAL/Polyhedron_3.h>
// This is the test file for the new design. Skip new design test for
@ -66,7 +66,7 @@ const char* tetra = "OFF\n"
void test_file_IO_OFF() {
typedef Cartesian<double> Kernel;
typedef Simple_cartesian<double> Kernel;
typedef Polyhedron_3<Kernel> Polyhedron;
{
Polyhedron P;

4
Principal_component_analysis/test/Principal_component_analysis/test_barycenter.cpp
View File

@ -4,13 +4,13 @@
#include <vector>
#include <cassert>
#include <CGAL/Cartesian.h>
#include <CGAL/Simple_cartesian.h>
#include <CGAL/barycenter.h>
#include <CGAL/centroid.h>
typedef double FT;
typedef CGAL::Cartesian<FT> K;
typedef CGAL::Simple_cartesian<FT> K;
typedef K::Point_2 Point_2;
typedef K::Point_3 Point_3;

4
Principal_component_analysis/test/Principal_component_analysis/test_bounding_box.cpp
View File

@ -4,11 +4,11 @@
#include <vector>
#include <cassert>
#include <CGAL/Cartesian.h>
#include <CGAL/Simple_cartesian.h>
#include <CGAL/bounding_box.h>
typedef double FT;
typedef CGAL::Cartesian<FT> K;
typedef CGAL::Simple_cartesian<FT> K;
typedef K::Point_2 Point_2;
typedef K::Point_3 Point_3;
typedef K::Segment_2 Segment_2;

4
Principal_component_analysis/test/Principal_component_analysis/test_linear_least_squares_fitting_circles_2.cpp
View File

@ -2,13 +2,13 @@
// Example program for the linear_least_square_fitting function on a set of circles in 2D
#include <CGAL/Cartesian.h>
#include <CGAL/Simple_cartesian.h>
#include <CGAL/linear_least_squares_fitting_2.h>
#include <list>
typedef double FT;
typedef CGAL::Cartesian<FT> K;
typedef CGAL::Simple_cartesian<FT> K;
typedef K::Line_2 Line;
typedef K::Point_2 Point;
typedef K::Circle_2 Circle;

4
Principal_component_analysis/test/Principal_component_analysis/test_linear_least_squares_fitting_cuboids_3.cpp
View File

@ -1,7 +1,7 @@
#include <CGAL/internal/disable_deprecation_warnings_and_errors.h>
// Example program for the linear_least_square_fitting function on set of cuboids in 3D
#include <CGAL/Cartesian.h>
#include <CGAL/Simple_cartesian.h>
#include <CGAL/linear_least_squares_fitting_3.h>
#include <list>
@ -10,7 +10,7 @@
#endif
typedef double FT;
typedef CGAL::Cartesian<FT> Kernel;
typedef CGAL::Simple_cartesian<FT> Kernel;
typedef Kernel::Line_3 Line;
typedef Kernel::Plane_3 Plane;
typedef Kernel::Point_3 Point;

6
Principal_component_analysis/test/Principal_component_analysis/test_linear_least_squares_fitting_points_2.cpp
View File

@ -1,7 +1,7 @@
#include <CGAL/internal/disable_deprecation_warnings_and_errors.h>
// test for the linear_least_square_fitting() functions.
#include <CGAL/Cartesian.h>
#include <CGAL/Simple_cartesian.h>
#include <CGAL/algorithm.h>
#include <CGAL/linear_least_squares_fitting_2.h>
#include <CGAL/point_generators_2.h>
@ -93,11 +93,11 @@ int main()
{
std::cout << "Test 2D linear least squares fitting of points" << std::endl;
typedef CGAL::Cartesian<double> Kernel_double;
typedef CGAL::Simple_cartesian<double> Kernel_double;
test_2D<Kernel_double>();
test_2D_point_set<Kernel_double>(100);
typedef CGAL::Cartesian<float> Kernel_float;
typedef CGAL::Simple_cartesian<float> Kernel_float;
test_2D<Kernel_float>();
test_2D_point_set<Kernel_float>(100);

4
Principal_component_analysis/test/Principal_component_analysis/test_linear_least_squares_fitting_points_3.cpp
View File

@ -3,7 +3,7 @@
// test for the linear_least_square_fitting() functions.
#include <CGAL/Cartesian.h>
#include <CGAL/Simple_cartesian.h>
#include <CGAL/linear_least_squares_fitting_3.h>
#include <CGAL/Default_diagonalize_traits.h>
@ -13,7 +13,7 @@
#include <list>
// types
typedef CGAL::Cartesian<float> Kernel;
typedef CGAL::Simple_cartesian<float> Kernel;
typedef Kernel::FT FT;
typedef Kernel::Line_3 Line;
typedef Kernel::Point_3 Point;

4
Principal_component_analysis/test/Principal_component_analysis/test_linear_least_squares_fitting_rectangles_2.cpp
View File

@ -3,7 +3,7 @@
// test for the linear_least_square_fitting() functions.
#include <CGAL/Cartesian.h>
#include <CGAL/Simple_cartesian.h>
#include <CGAL/algorithm.h>
#include <CGAL/linear_least_squares_fitting_2.h>
#include <CGAL/point_generators_2.h>
@ -14,7 +14,7 @@
#define THRESHOLD 0.001
// types
typedef CGAL::Cartesian<double> Kernel;
typedef CGAL::Simple_cartesian<double> Kernel;
typedef Kernel::FT FT;
typedef Kernel::Line_2 Line_2;

4
Principal_component_analysis/test/Principal_component_analysis/test_linear_least_squares_fitting_segments_2.cpp
View File

@ -3,7 +3,7 @@
// test for the linear_least_square_fitting() functions.
#include <CGAL/Cartesian.h>
#include <CGAL/Simple_cartesian.h>
#include <CGAL/algorithm.h>
#include <CGAL/linear_least_squares_fitting_2.h>
#include <CGAL/point_generators_2.h>
@ -14,7 +14,7 @@
#define THRESHOLD 0.001
// types
typedef CGAL::Cartesian<double> Kernel;
typedef CGAL::Simple_cartesian<double> Kernel;
typedef Kernel::FT FT;
typedef Kernel::Line_2 Line_2;

4
Principal_component_analysis/test/Principal_component_analysis/test_linear_least_squares_fitting_segments_3.cpp
View File

@ -3,7 +3,7 @@
// test for the linear_least_square_fitting() functions.
#include <CGAL/Cartesian.h>
#include <CGAL/Simple_cartesian.h>
#include <CGAL/algorithm.h>
#include <CGAL/linear_least_squares_fitting_3.h>
#include <CGAL/point_generators_3.h>
@ -18,7 +18,7 @@
#define THRESHOLD 0.001
// types
typedef CGAL::Cartesian<double> Kernel;
typedef CGAL::Simple_cartesian<double> Kernel;
typedef Kernel::FT FT;
typedef Kernel::Line_3 Line;

4
Principal_component_analysis/test/Principal_component_analysis/test_linear_least_squares_fitting_spheres_3.cpp
View File

@ -2,7 +2,7 @@
#include <CGAL/internal/disable_deprecation_warnings_and_errors.h>
#include <CGAL/Cartesian.h>
#include <CGAL/Simple_cartesian.h>
#include <CGAL/linear_least_squares_fitting_3.h>
#ifdef CGAL_EIGEN3_ENABLED
#include <CGAL/Eigen_diagonalize_traits.h>
@ -12,7 +12,7 @@
#include <list>
typedef double FT;
typedef CGAL::Cartesian<FT> Kernel;
typedef CGAL::Simple_cartesian<FT> Kernel;
typedef Kernel::Line_3 Line;
typedef Kernel::Plane_3 Plane;
typedef Kernel::Point_3 Point;

4
Principal_component_analysis/test/Principal_component_analysis/test_linear_least_squares_fitting_tetrahedra_3.cpp
View File

@ -3,7 +3,7 @@
// Example program for the linear_least_square_fitting function
// on a set of tetrahedra in 3D
#include <CGAL/Cartesian.h>
#include <CGAL/Simple_cartesian.h>
#include <CGAL/linear_least_squares_fitting_3.h>
#include <list>
@ -12,7 +12,7 @@
#endif
typedef double FT;
typedef CGAL::Cartesian<FT> Kernel;
typedef CGAL::Simple_cartesian<FT> Kernel;
typedef Kernel::Line_3 Line;
typedef Kernel::Plane_3 Plane;
typedef Kernel::Point_3 Point;

4
Principal_component_analysis/test/Principal_component_analysis/test_linear_least_squares_fitting_triangles_2.cpp
View File

@ -1,7 +1,7 @@
#include <CGAL/internal/disable_deprecation_warnings_and_errors.h>
// test for the linear_least_square_fitting() functions.
#include <CGAL/Cartesian.h>
#include <CGAL/Simple_cartesian.h>
#include <CGAL/algorithm.h>
#include <CGAL/linear_least_squares_fitting_2.h>
#include <CGAL/point_generators_2.h>
@ -12,7 +12,7 @@
#define THRESHOLD 0.001
typedef CGAL::Cartesian<double> Kernel;
typedef CGAL::Simple_cartesian<double> Kernel;
typedef Kernel::FT FT;
typedef Kernel::Line_2 Line_2;
typedef Kernel::Point_2 Point_2;

4
Principal_component_analysis/test/Principal_component_analysis/test_linear_least_squares_fitting_triangles_3.cpp
View File

@ -1,7 +1,7 @@
#include <CGAL/internal/disable_deprecation_warnings_and_errors.h>
// Example program for the linear_least_square_fitting function on set of triangles in 3D
#include <CGAL/Cartesian.h>
#include <CGAL/Simple_cartesian.h>
#include <CGAL/linear_least_squares_fitting_3.h>
#ifdef CGAL_EIGEN3_ENABLED
#include <CGAL/Diagonalize_traits.h>
@ -10,7 +10,7 @@
#include <list>
typedef double FT;
typedef CGAL::Cartesian<FT> Kernel;
typedef CGAL::Simple_cartesian<FT> Kernel;
typedef Kernel::Line_3 Line;
typedef Kernel::Plane_3 Plane;
typedef Kernel::Point_3 Point;