Name
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. |
Year | DOI | Venue |
|---|---|---|
1990 | 10.1145/98524.98565 | Symposium on Computational Geometry 2013 |
Keywords | Field | DocType |
equal part,smallest possible total length,polynomial approximation sceme,exact fast algorithm,convex polygon,optimal bisection,simple polygon | Discrete mathematics,Rectilinear polygon,Combinatorics,Polygon,Polygon covering,Regular polygon,Simple polygon,Star-shaped polygon,Equiangular polygon,Mathematics,Monotone polygon | Conference |
ISBN | Citations | PageRank |
0-89791-362-0 | 0 | 0.34 |
References | Authors | |
1 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Elias Koutsoupias | 1 | 1894 | 182.77 |
| Christos H. Papadimitriou | 2 | 16671 | 3192.54 |
| Martha Sideri | 3 | 409 | 46.17 |