Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
$k$-Piece Dissection is not known to be decidable. Given two polygons and an integer $k$, is there a dissection of the first polygon into k pieces that can be reassembled into the second one?
