|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Go to the source code of this file.
Functions | |
| static bool | is_subsequence (const Array< Point > &original, const Array< Point > &sub) |
| static Array< Point > | poly_verts (const Polygon &poly) |
| static Polygon | make_circle (size_t n, double radius=10.0, double cx=0.0, double cy=0.0) |
| TEST_F (GeomAlgorithmsTest, DP_StraightLine) | |
| TEST_F (GeomAlgorithmsTest, DP_LShape) | |
| TEST_F (GeomAlgorithmsTest, DP_Zigzag) | |
| TEST_F (GeomAlgorithmsTest, DP_Rectangle_Closed) | |
| TEST_F (GeomAlgorithmsTest, DP_EpsilonZero_KeepsAll) | |
| TEST_F (GeomAlgorithmsTest, DP_LargeEpsilon_MinimalOutput) | |
| TEST_F (GeomAlgorithmsTest, DP_TwoPoints) | |
| TEST_F (GeomAlgorithmsTest, DP_CircleApprox_Progressive) | |
| TEST_F (GeomAlgorithmsTest, VW_SmallTriangleRemoval) | |
| TEST_F (GeomAlgorithmsTest, VW_Staircase) | |
| TEST_F (GeomAlgorithmsTest, VW_Rectangle_Closed) | |
| TEST_F (GeomAlgorithmsTest, VW_ThresholdZero_KeepsAll) | |
| TEST_F (GeomAlgorithmsTest, VW_LargeThreshold_MinimalOutput) | |
| TEST_F (GeomAlgorithmsTest, VW_TwoPoints) | |
| TEST_F (GeomAlgorithmsTest, VW_CircleApprox_Closed) | |
| TEST_F (GeomAlgorithmsTest, Simplification_SubsequenceProperty_DP) | |
| TEST_F (GeomAlgorithmsTest, Simplification_SubsequenceProperty_VW) | |
| TEST_F (GeomAlgorithmsTest, Simplification_CountProperty) | |
| TEST_F (GeomAlgorithmsTest, DP_FirstLastPreserved) | |
| TEST_F (GeomAlgorithmsTest, VW_FirstLastPreserved) | |
| TEST_F (GeomAlgorithmsTest, DP_DynListOverload) | |
| TEST_F (GeomAlgorithmsTest, VW_DynListOverload) | |
| TEST_F (GeomAlgorithmsTest, Chaikin_Triangle_OneIteration) | |
| TEST_F (GeomAlgorithmsTest, Chaikin_Square_OneIteration) | |
| TEST_F (GeomAlgorithmsTest, Chaikin_VertexCount_Closed) | |
| TEST_F (GeomAlgorithmsTest, Chaikin_VertexCount_Open) | |
| TEST_F (GeomAlgorithmsTest, Chaikin_ClosedPolygon_RemainsValid) | |
| TEST_F (GeomAlgorithmsTest, Chaikin_Circle_ConvergesToCircle) | |
| TEST_F (GeomAlgorithmsTest, Chaikin_CustomRatio) | |
| TEST_F (GeomAlgorithmsTest, Chaikin_DomainErrors) | |
| TEST_F (GeomAlgorithmsTest, Chaikin_DynListOverload) | |
| TEST_F (GeomAlgorithmsTest, Chaikin_TwoPoints_Open) | |
Definition at line 37 of file geom_algorithms_test_simplification.cc.
References Aleph::and, and Aleph::divide_and_conquer_partition_dp().
Referenced by TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST_F(), and TEST_F().
|
static |
Definition at line 54 of file geom_algorithms_test_simplification.cc.
References Aleph::Polygon::add_vertex(), Aleph::Polygon::close(), cos(), Aleph::divide_and_conquer_partition_dp(), and sin().
| TEST_F | ( | GeomAlgorithmsTest | , |
| Chaikin_Circle_ConvergesToCircle | |||
| ) |
| TEST_F | ( | GeomAlgorithmsTest | , |
| Chaikin_ClosedPolygon_RemainsValid | |||
| ) |
Definition at line 506 of file geom_algorithms_test_simplification.cc.
References Aleph::Polygon::add_vertex(), Aleph::Polygon::close(), Aleph::divide_and_conquer_partition_dp(), k, poly_verts(), and Aleph::ChaikinSmoothing::smooth_polygon().
| TEST_F | ( | GeomAlgorithmsTest | , |
| Chaikin_CustomRatio | |||
| ) |
Definition at line 567 of file geom_algorithms_test_simplification.cc.
References Aleph::Polygon::add_vertex(), Aleph::Polygon::close(), Aleph::divide_and_conquer_partition_dp(), poly_verts(), and Aleph::ChaikinSmoothing::smooth_polygon().
| TEST_F | ( | GeomAlgorithmsTest | , |
| Chaikin_DomainErrors | |||
| ) |
Definition at line 586 of file geom_algorithms_test_simplification.cc.
References Aleph::Polygon::add_vertex(), Aleph::Polygon::close(), Aleph::divide_and_conquer_partition_dp(), and Aleph::ChaikinSmoothing::smooth_polygon().
| TEST_F | ( | GeomAlgorithmsTest | , |
| Chaikin_DynListOverload | |||
| ) |
Definition at line 611 of file geom_algorithms_test_simplification.cc.
References Aleph::DynList< T >::append(), and Aleph::divide_and_conquer_partition_dp().
| TEST_F | ( | GeomAlgorithmsTest | , |
| Chaikin_Square_OneIteration | |||
| ) |
Definition at line 444 of file geom_algorithms_test_simplification.cc.
References Aleph::Polygon::add_vertex(), Aleph::Polygon::close(), Aleph::divide_and_conquer_partition_dp(), poly_verts(), and Aleph::ChaikinSmoothing::smooth_polygon().
| TEST_F | ( | GeomAlgorithmsTest | , |
| Chaikin_Triangle_OneIteration | |||
| ) |
Definition at line 431 of file geom_algorithms_test_simplification.cc.
References Aleph::Polygon::add_vertex(), Aleph::Polygon::close(), Aleph::divide_and_conquer_partition_dp(), poly_verts(), and Aleph::ChaikinSmoothing::smooth_polygon().
| TEST_F | ( | GeomAlgorithmsTest | , |
| Chaikin_TwoPoints_Open | |||
| ) |
Definition at line 628 of file geom_algorithms_test_simplification.cc.
References Aleph::Array< T >::append(), and Aleph::divide_and_conquer_partition_dp().
| TEST_F | ( | GeomAlgorithmsTest | , |
| Chaikin_VertexCount_Closed | |||
| ) |
Definition at line 465 of file geom_algorithms_test_simplification.cc.
References Aleph::Polygon::add_vertex(), Aleph::Polygon::close(), cos(), Aleph::divide_and_conquer_partition_dp(), k, poly_verts(), sin(), and Aleph::ChaikinSmoothing::smooth_polygon().
| TEST_F | ( | GeomAlgorithmsTest | , |
| Chaikin_VertexCount_Open | |||
| ) |
Definition at line 486 of file geom_algorithms_test_simplification.cc.
References Aleph::Array< T >::append(), and Aleph::divide_and_conquer_partition_dp().
| TEST_F | ( | GeomAlgorithmsTest | , |
| DP_CircleApprox_Progressive | |||
| ) |
Definition at line 181 of file geom_algorithms_test_simplification.cc.
References Aleph::divide_and_conquer_partition_dp(), make_circle(), poly_verts(), and Aleph::DouglasPeuckerSimplification::simplify_polygon().
| TEST_F | ( | GeomAlgorithmsTest | , |
| DP_DynListOverload | |||
| ) |
Definition at line 401 of file geom_algorithms_test_simplification.cc.
References Aleph::DynList< T >::append(), and Aleph::divide_and_conquer_partition_dp().
| TEST_F | ( | GeomAlgorithmsTest | , |
| DP_EpsilonZero_KeepsAll | |||
| ) |
Definition at line 140 of file geom_algorithms_test_simplification.cc.
References Aleph::Array< T >::append(), and Aleph::divide_and_conquer_partition_dp().
| TEST_F | ( | GeomAlgorithmsTest | , |
| DP_FirstLastPreserved | |||
| ) |
Definition at line 363 of file geom_algorithms_test_simplification.cc.
References Aleph::Array< T >::append(), and Aleph::divide_and_conquer_partition_dp().
| TEST_F | ( | GeomAlgorithmsTest | , |
| DP_LargeEpsilon_MinimalOutput | |||
| ) |
Definition at line 154 of file geom_algorithms_test_simplification.cc.
References Aleph::Array< T >::append(), and Aleph::divide_and_conquer_partition_dp().
| TEST_F | ( | GeomAlgorithmsTest | , |
| DP_LShape | |||
| ) |
Definition at line 88 of file geom_algorithms_test_simplification.cc.
References Aleph::Array< T >::append(), and Aleph::divide_and_conquer_partition_dp().
| TEST_F | ( | GeomAlgorithmsTest | , |
| DP_Rectangle_Closed | |||
| ) |
Definition at line 124 of file geom_algorithms_test_simplification.cc.
References Aleph::Polygon::add_vertex(), Aleph::divide_and_conquer_partition_dp(), poly_verts(), and Aleph::DouglasPeuckerSimplification::simplify_polygon().
| TEST_F | ( | GeomAlgorithmsTest | , |
| DP_StraightLine | |||
| ) |
Definition at line 70 of file geom_algorithms_test_simplification.cc.
References Aleph::Array< T >::append(), and Aleph::divide_and_conquer_partition_dp().
| TEST_F | ( | GeomAlgorithmsTest | , |
| DP_TwoPoints | |||
| ) |
Definition at line 168 of file geom_algorithms_test_simplification.cc.
References Aleph::Array< T >::append(), and Aleph::divide_and_conquer_partition_dp().
| TEST_F | ( | GeomAlgorithmsTest | , |
| DP_Zigzag | |||
| ) |
Definition at line 105 of file geom_algorithms_test_simplification.cc.
References Aleph::Array< T >::append(), and Aleph::divide_and_conquer_partition_dp().
| TEST_F | ( | GeomAlgorithmsTest | , |
| Simplification_CountProperty | |||
| ) |
| TEST_F | ( | GeomAlgorithmsTest | , |
| Simplification_SubsequenceProperty_DP | |||
| ) |
Definition at line 305 of file geom_algorithms_test_simplification.cc.
References Aleph::Array< T >::append(), Aleph::divide_and_conquer_partition_dp(), and is_subsequence().
| TEST_F | ( | GeomAlgorithmsTest | , |
| Simplification_SubsequenceProperty_VW | |||
| ) |
Definition at line 326 of file geom_algorithms_test_simplification.cc.
References Aleph::Array< T >::append(), Aleph::divide_and_conquer_partition_dp(), and is_subsequence().
| TEST_F | ( | GeomAlgorithmsTest | , |
| VW_CircleApprox_Closed | |||
| ) |
Definition at line 287 of file geom_algorithms_test_simplification.cc.
References Aleph::divide_and_conquer_partition_dp(), make_circle(), and poly_verts().
| TEST_F | ( | GeomAlgorithmsTest | , |
| VW_DynListOverload | |||
| ) |
Definition at line 415 of file geom_algorithms_test_simplification.cc.
References Aleph::DynList< T >::append(), and Aleph::divide_and_conquer_partition_dp().
| TEST_F | ( | GeomAlgorithmsTest | , |
| VW_FirstLastPreserved | |||
| ) |
Definition at line 382 of file geom_algorithms_test_simplification.cc.
References Aleph::Array< T >::append(), and Aleph::divide_and_conquer_partition_dp().
| TEST_F | ( | GeomAlgorithmsTest | , |
| VW_LargeThreshold_MinimalOutput | |||
| ) |
Definition at line 262 of file geom_algorithms_test_simplification.cc.
References Aleph::Array< T >::append(), and Aleph::divide_and_conquer_partition_dp().
| TEST_F | ( | GeomAlgorithmsTest | , |
| VW_Rectangle_Closed | |||
| ) |
Definition at line 232 of file geom_algorithms_test_simplification.cc.
References Aleph::Polygon::add_vertex(), Aleph::divide_and_conquer_partition_dp(), and poly_verts().
| TEST_F | ( | GeomAlgorithmsTest | , |
| VW_SmallTriangleRemoval | |||
| ) |
Definition at line 199 of file geom_algorithms_test_simplification.cc.
References Aleph::Array< T >::append(), and Aleph::divide_and_conquer_partition_dp().
| TEST_F | ( | GeomAlgorithmsTest | , |
| VW_Staircase | |||
| ) |
Definition at line 212 of file geom_algorithms_test_simplification.cc.
References Aleph::Array< T >::append(), and Aleph::divide_and_conquer_partition_dp().
| TEST_F | ( | GeomAlgorithmsTest | , |
| VW_ThresholdZero_KeepsAll | |||
| ) |
Definition at line 248 of file geom_algorithms_test_simplification.cc.
References Aleph::Array< T >::append(), and Aleph::divide_and_conquer_partition_dp().
| TEST_F | ( | GeomAlgorithmsTest | , |
| VW_TwoPoints | |||
| ) |
Definition at line 276 of file geom_algorithms_test_simplification.cc.
References Aleph::Array< T >::append(), and Aleph::divide_and_conquer_partition_dp().