Solar energy paper index
On the Counting Sequence of Z-convex Polyominoes
One-line summary
A solar energy research paper on On the Counting Sequence of Z-convex Polyominoes.
Engineering notes
Engineering notes will be added by the Power for Solar editorial team.
Chinese explanation / 中文解读
中文解读待补充：本站会优先为光伏效率、钙钛矿太阳能电池、储能技术、太阳能热利用、BIPV、并网技术等高价值论文补充中文说明。
Original abstract
The degree of convexity of a convex polyomino P is the smallest integer k such that any two cells of P can be joined by a monotone path inside P with at most k changes of direction. In this paper, we present a set of formulas and equations that are the basis of a C++ program that allows you to compute the longest counting sequence known to date (with respect to the area) of convex polyominoes of degree of convexity at most 2
Links and sources
Need this topic turned into a technical roadmap?
Power for Solar can prepare a custom solar energy literature review, simulation code map, dataset map, and B2B photovoltaic technology assessment.
Request B2B research
Comments