3rd-party/poly2tri
1
0
Fork 0
mirror of https://github.com/jhasse/poly2tri.git synced 2024-11-29 16:53:30 +01:00
Code Issues Projects Releases Wiki Activity

NarrowQuadTest triangulation succeeds now

Browse Source
This commit is contained in:
Roy Stogner 2022-03-15 20:36:53 -05:00
parent 57b3039c05
commit cc1e657107
1 changed files with 6 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
unittest/main.cpp
View File

@ -49,7 +49,8 @@ BOOST_AUTO_TEST_CASE(QuadTest)
BOOST_AUTO_TEST_CASE(NarrowQuadTest) BOOST_AUTO_TEST_CASE(NarrowQuadTest)
{ {
// Very narrow quad that demonstrates a failure case during triangulation // Very narrow quad that used to demonstrate a failure case during
// triangulation
std::vector<p2t::Point*> polyline { std::vector<p2t::Point*> polyline {
new p2t::Point(0.0, 0.0), new p2t::Point(0.0, 0.0),
new p2t::Point(1.0e-05, 0.0), new p2t::Point(1.0e-05, 0.0),
@ -57,7 +58,10 @@ BOOST_AUTO_TEST_CASE(NarrowQuadTest)
new p2t::Point(1.0e-04, 3.0e-07) new p2t::Point(1.0e-04, 3.0e-07)
}; };
p2t::CDT cdt{ polyline }; p2t::CDT cdt{ polyline };
BOOST_CHECK_THROW(cdt.Triangulate(), std::runtime_error); BOOST_CHECK_NO_THROW(cdt.Triangulate());
const auto result = cdt.GetTriangles();
BOOST_REQUIRE_EQUAL(result.size(), 2);
BOOST_CHECK(p2t::IsDelaunay(result));
for (const auto p : polyline) { for (const auto p : polyline) {
delete p; delete p;
} }