void CArea::Reorder()
{
// curves may have been added with wrong directions
// test all kurves to see which one are outsides and which are insides and
// make sure outsides are anti-clockwise and insides are clockwise
// returns 0, if the curves are OK
// returns 1, if the curves are overlapping
CAreaOrderer ao;
for(std::list<CCurve>::iterator It = m_curves.begin(), ItNext=It; It != m_curves.end(); It=ItNext)
{
++ItNext;
CCurve& curve = *It;
if(!It->IsClosed())
continue;
ao.Insert(make_shared<CCurve>(curve));
if(m_set_processing_length_in_split)
{
CArea::m_processing_done += (m_split_processing_length / m_curves.size());
}
m_curves.erase(It);
}
if(ao.m_top_level)
ao.m_top_level->GetArea(*this);
}
void CArea::Reorder()
{
// curves may have been added with wrong directions
// test all kurves to see which one are outsides and which are insides and
// make sure outsides are anti-clockwise and insides are clockwise
// returns 0, if the curves are OK
// returns 1, if the curves are overlapping
CAreaOrderer ao;
for(std::list<CCurve>::iterator It = m_curves.begin(); It != m_curves.end(); It++)
{
CCurve& curve = *It;
ao.Insert(&curve);
if(m_set_processing_length_in_split)
{
CArea::m_processing_done += (m_split_processing_length / m_curves.size());
}
}
*this = ao.ResultArea();
}
