Solar energy paper index
An algorithmic approach for computing fundamental domains of crystallographic groups
One-line summary
A solar energy research paper on An algorithmic approach for computing fundamental domains of crystallographic groups.
Engineering notes
Engineering notes will be added by the Power for Solar editorial team.
Chinese explanation / 中文解读
中文解读待补充：本站会优先为光伏效率、钙钛矿太阳能电池、储能技术、太阳能热利用、BIPV、并网技术等高价值论文补充中文说明。
Original abstract
A crystallographic group is a discrete subgroup of the Euclidean group $\operatorname{E}(n)$ that has a compact fundamental domain. Since such a crystallographic group $Γ$ is infinite, computing fundamental domains of $Γ$ is algorithmically challenging. We address this difficulty by targeting the computation of Dirichlet cells that can form fundamental domains of $Γ$. We show that the half-spaces defining such a Dirichlet cell can be derived from elements of $Γ$ acting on $\mathbb{R}^n$ that can be expressed as words of bounded length in a suitable generating set. Based on these results, we design an algorithm for the computation of fundamental domains of crystallographic groups and exploit it to study the construction of topological interlocking assemblies.
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