All Questions

Problem: for a fixed integer $m\geqslant 3$ find all $n$ such that no $n$-gon can be dissected into convex $m$-gons. I would be very grateful for any information on this problem. Remark 1. There ...

I am interested in the following computational problem. Given a geometric graph (i.e, a graph drawn in the plane so that its vertices are represented by points in general position and its edges are ...

Ref: Inside-out polygonal dissections Inside-out dissections of solids Definitions: A polygon P has an inside-out dissection into another polygon P' if P′ is congruent to P, and the perimeter of P ...

An earlier question: Facility location on manifolds A possibly related earlier post: Cutting convex regions into equal diameter and equal least width pieces - 2 The minimax facility location problem ...

Covering a specific convex shape S with n copies of another specified convex shape S' (which may be different from S) is well studied - for example, https://erich-friedman.github.io/packing/index.html....

We add a bit to: Bounds for minimax facility location in a convex region Two earlier posts: Cutting convex regions into equal diameter and equal least width pieces - 2 and Facility location on ...