Abstract | ||
---|---|---|
Given a sequence S of angles at n vertices of a rectilinear polygon, S directly defines (or realizes) a set of rectilinear polygons in the integer grid. Among such realizations, we consider the one P(S) with minimum area. Let delta(n) be the minimum of the area of P(S) over all angle sequences S of length n, and Delta(n) be the maximum. In this paper, we provide the explicit formula for delta(n) and Delta(n). |
Year | DOI | Venue |
---|---|---|
2012 | 10.1007/978-3-642-35261-4_65 | ALGORITHMS AND COMPUTATION, ISAAC 2012 |
Field | DocType | Volume |
Integer,Discrete mathematics,Monotonic function,Combinatorics,Rectilinear polygon,Polygon,Vertex (geometry),Computer science,Smoothing group,Simple polygon,Grid | Conference | 7676 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
4 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Sang Won Bae | 1 | 189 | 31.53 |
Yoshio Okamoto | 2 | 170 | 28.50 |
Chan-su Shin | 3 | 206 | 26.76 |