On the optimal bisection of a polygon (extended abstract)
Elias Koutsoupias, Christos H. Papadimitriou, Martha Sideri · 1990
We give a polynomial approximation sceme for subdividing a simple polygon into approximately equal parts by curves of the smallest possible total length. For convex polygons we show that an exact fast algorithm is possible. Several generalizations are shown NP-complete.