| 371 | } |
| 372 | |
| 373 | void fixMultipleEdges( Mesh & mesh, const std::vector<MultipleEdge> & multipleEdges ) |
| 374 | { |
| 375 | if ( multipleEdges.empty() ) |
| 376 | return; |
| 377 | MR_TIMER; |
| 378 | MR_WRITER( mesh ) |
| 379 | |
| 380 | for ( const auto & mE : multipleEdges ) |
| 381 | { |
| 382 | int num = 0; |
| 383 | for ( auto e : orgRing( mesh.topology, mE.first ) ) |
| 384 | { |
| 385 | if ( mesh.topology.dest( e ) != mE.second ) |
| 386 | continue; |
| 387 | if ( num++ == 0 ) |
| 388 | continue; // skip the first edge in the group |
| 389 | mesh.splitEdge( e.sym() ); |
| 390 | } |
| 391 | assert( num > 1 ); //it was really multiply connected pair of vertices |
| 392 | } |
| 393 | } |
| 394 | |
| 395 | void fixMultipleEdges( Mesh & mesh ) |
| 396 | { |
no test coverage detected