Find a generic polygon that can lead to the best case behavior in the Hertel-Mehlhorn algorithm with respect to the optimum:

1. Find a generic olyan lead to the bes cae beaior ir algorithm with respect to the optimum: H-M produce 2r pieces, but possible. (2 points) pieces are 1. Find a generic olyan lead to the bes cae beaior ir algorithm with respect to the optimum: H-M produce 2r pieces, but possible. (2 points) pieces are