Piece-set Operators

• Runtime complexity

  • Naïve implementations typically O(nm) or worse
  • No piece overlaps O(n + m)
  • All piece overlaps O(nm)

• Further optimization possible with some program analysis

Previous slide

Next slide

Back to first slide

View graphic version