具有少量活力的单位正方形的排序
Ranking Unit Squares with Few Visibilities
摘要：
给定平面上的一组n个单位正方形，目标是以只有少数正方形垂直看到对方的方式在空间中排列它们。我们证明，排名的平方米，根据字典顺序的中心结果在最多3n-7成对的vibrium n至少4。我们还表明，这一界是最好的可能性，通过展示一组至少3n-7成对的vibrium下的任何排名的n平方。
英文摘要：
Given a set of n unit squares in the plane, the goal is to rank them in space in such a way that only few squares see each other vertically. We prove that ranking the squares according to the lexicographic order of their centers results in at most 3n-7 pairwise visibilities for n at least 4. We also show that this bound is best possible, by exhibiting a set of n squares with at least 3n-7 pairwise visibilities under any ranking.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
