Name
Abstract | ||
|---|---|---|
A minimum k-partition decomposes a rectilinear polygon with n vertices into aminimum number of disjoint rectilinear components with no more than k vertices each (k=8; most results are also new for k=6. |
Year | DOI | Venue |
|---|---|---|
1990 | 10.1016/S0747-7171(08)80022-3 | J. Symb. Comput. |
Keywords | DocType | Volume |
disjoint rectilinear component,aminimum number,rectilinear polygon,Minimum K-partitioning,n vertex,minimum k-partition | Journal | 9 |
Issue | ISSN | Citations |
4 | Journal of Symbolic Computation | 2 |
PageRank | References | Authors |
0.37 | 16 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Oliver Günther | 1 | 85 | 29.91 |