haskal
/
kicad
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Add test for detecting arcs post clipper

This commit is contained in:
Roberto Fernandez Bautista 2021-05-14 18:36:29 +01:00 committed by Jon Evans
parent 3f73d8c2b5
commit 2f069c0b19
1 changed files with 40 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

37
qa/libs/kimath/geometry/test_shape_poly_set_arcs.cpp
View File

@ -18,6 +18,7 @@
* with this program. If not, see <http://www.gnu.org/licenses/>. * with this program. If not, see <http://www.gnu.org/licenses/>.
*/ */
#include <string>
#include <tuple> #include <tuple>
#include <unit_test_utils/unit_test_utils.h> #include <unit_test_utils/unit_test_utils.h>
@ -29,24 +30,52 @@
BOOST_AUTO_TEST_SUITE( CurvedPolys ) BOOST_AUTO_TEST_SUITE( CurvedPolys )
/** /**
* Simplify the polygon a large number of times and check that the area * Simplify the polygon a large number of times and check that the area
* does not change. * does not change and also that the arcs are the same before and after
*/ */
BOOST_AUTO_TEST_CASE( TestSimplify ) BOOST_AUTO_TEST_CASE( TestSimplify )
{ {
KI_TEST::CommonTestData testData; KI_TEST::CommonTestData testData;
SHAPE_POLY_SET testPoly = testData.holeyCurvedPolySingle;
double originalArea = testData.holeyCurvedPolySingle.Area(); std::map<std::string, SHAPE_POLY_SET> polysToTest =
{
{ "Case 1: Single polygon", testData.holeyCurvedPolySingle },
{ "Case 2: Multi polygon", testData.holeyCurvedPolyMulti }
};
for( int i = 1; i < 20; i++ ) for( std::pair<std::string, SHAPE_POLY_SET> testCase : polysToTest )
{
BOOST_TEST_CONTEXT( testCase.first )
{
SHAPE_POLY_SET testPoly = testCase.second;
double originalArea = testPoly.Area();
std::vector<SHAPE_ARC> originalArcs;
testPoly.GetArcs( originalArcs );
for( int i = 1; i <= 3; i++ )
{ {
BOOST_TEST_CONTEXT( "Simplify Iteration " << i ) BOOST_TEST_CONTEXT( "Simplify Iteration " << i )
{ {
testPoly.Simplify( SHAPE_POLY_SET::POLYGON_MODE::PM_FAST ); testPoly.Simplify( SHAPE_POLY_SET::POLYGON_MODE::PM_FAST );
std::vector<SHAPE_ARC> foundArcs;
testPoly.GetArcs( foundArcs );
BOOST_CHECK_EQUAL( testPoly.Area(), originalArea ); BOOST_CHECK_EQUAL( testPoly.Area(), originalArea );
BOOST_CHECK_EQUAL( originalArcs.size(), foundArcs.size() );
KI_TEST::CheckUnorderedMatches( originalArcs, foundArcs,
[]( const SHAPE_ARC& aA, const SHAPE_ARC& aB ) -> bool
{
// We accept that the arcs could be reversed after Simplify
return aA == aB || aA.Reversed() == aB;
} );
}
}
} }
} }
} }