message: simplify: Improve performance of edge loop remap
  We don't really need to fill loop[v] for vertices that have been
  collapsed. While it may be nice to do this, this takes time and we'll
  never use these entries again since there won't be any references left.
  This makes edge loop remapping ~30% faster.
diff: @@ -797,14 +797,6 @@ void remapEdgeLoops(unsigned int* loop, size_t vertex_count, const unsigned int*
  }
  }
  }
  -
  - for (size_t i = 0; i < vertex_count; ++i)
  - {
  - if (collapse_remap[i] != i)
  - {
  - loop[i] = ~0u;
  - }
  - }
  }
  } // namespace meshopt
  