On the optimal bisection of a polygon (extended abstract)

Authors:
Elias Koutsoupias;Christos H. Papadimitriou;Martha Sideri
Affiliations:
University of California at San Diego;University of California at San Diego;Computer Technology Institute, Patras, Greece
Venue:
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Year:
1990

Citing 2
Cited 0

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
The bisection width of grid graphs

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.