| 352 | } |
| 353 | |
| 354 | void MeshDecimator::updateQueue_() |
| 355 | { |
| 356 | MR_TIMER; |
| 357 | |
| 358 | Timer t( "compute" ); |
| 359 | auto & vec = queue_.c; |
| 360 | // recompute errors for outdated edges |
| 361 | BitSet del( vec.size(), false ); |
| 362 | BitSetParallelForAll( del, [&]( size_t i ) |
| 363 | { |
| 364 | auto& qe = vec[i]; |
| 365 | const auto ue = qe.uedgeId(); |
| 366 | if ( !validInQueue_.test( ue ) ) |
| 367 | return; |
| 368 | if ( !outdated_.test( ue ) ) |
| 369 | return; |
| 370 | if ( auto n = computeQueueElement_( qe.uedgeId(), qe.x.edgeOp == EdgeOp::CollapseOptPos ) ) |
| 371 | qe = *n; |
| 372 | else |
| 373 | del.set( i ); |
| 374 | } ); |
| 375 | outdated_.reset( 0_ue, outdated_.size() ); |
| 376 | numOutdated_ = 0; |
| 377 | |
| 378 | t.restart( "invalidate" ); |
| 379 | // removed valid flag for outdated edges with failed computeQueueElement_ |
| 380 | for ( auto i : del ) |
| 381 | validInQueue_.reset( vec[i].uedgeId() ); |
| 382 | |
| 383 | t.restart( "remove deleted" ); |
| 384 | // remove invalid and deleted edges from the queue |
| 385 | std::erase_if( vec, [&]( QueueElement & qe ) { return !validInQueue_.test( qe.uedgeId() ); } ); |
| 386 | |
| 387 | t.restart( "restore heap" ); |
| 388 | // sort elements to restore heap property |
| 389 | std::make_heap( vec.begin(), vec.end() ); |
| 390 | } |
| 391 | |
| 392 | QuadraticForm3f MeshDecimator::collapseForm_( UndirectedEdgeId ue, const Vector3f & collapsePos ) const |
| 393 | { |