关于矩形网格上一条线段所经过的瓦片数量
On the number of tiles visited by a line segment on a rectangular grid
AI总结：
本文研究矩形网格上线段长度与所经过瓦片数的关系，分别在确定性和随机模型下刻画最大经过数、所需长度下确界及平均经过数与概率，并与布丰投针问题建立联系。
摘要：
考虑一条放置在由矩形瓦片构成的二维网格上的线段。本文研究线段长度与其所经过（即与之相交）的瓦片数量之间的关系。文中也明确考虑了正方形网格的情形，因为所研究的一些具体问题在该特殊情况下更易处理。线段的位置和方向可以建模为确定性的或随机的。在确定性情形下，对于给定长度，刻画了所能经过瓦片数的最大可能值；反过来，分析了为了经过期望数量的瓦片所需线段长度的下确界。在随机情形下，研究了正方形网格上平均经过的瓦片数以及经过最大数量瓦片的概率，并将其表示为线段长度的函数。这些问题与布丰投针问题及其拉普拉斯推广有关。
英文摘要：
Consider a line segment placed on a two-dimensional grid of rectangular tiles. This paper addresses the relationship between the length of the segment and the number of tiles it visits (i.e. has intersection with). The square grid is also considered explicitly, as some of the specific problems studied are more tractable in that particular case. The segment position and orientation can be modelled as either deterministic or random. In the deterministic setting, the maximum possible number of visited tiles is characterized for a given length, and conversely, the infimum segment length needed to visit a desired number of tiles is analyzed. In the random setting, the average number of visited tiles and the probability of visiting the maximum number of tiles on a square grid are studied as a function of segment length. These questions are related to Buffon's needle problem and its extension by Laplace.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
