多边形的递减路径
Decreasing paths of polygons
AI总结:
本文研究多边形的递减路径,刻画三顶点以上多边形中可由凸包递减路径到达的子多边形,并证明有限次“拉入”操作即可实现。
摘要:
如果一条连续的多边形路径中各多边形的凸包构成一个递减的集合族,我们就称其为递减路径。对于任意具有三个以上顶点的多边形,我们刻画了其中可通过递减路径到达的多边形(即可达性问题),并证明这可以通过有限次应用“拉入”操作来实现(即 bang-bang 问题)。在三角形情形中,Goodman、Johansen、Ramsey 和 Frydman 等人曾结合非齐次 Markov 过程的可嵌入性问题研究过这些问题。
英文摘要:
We call a continuous path of polygons decreasing if the convex hulls of the polygons form a decreasing family of sets. For an arbitrary polygon of more than three vertices, we characterize the polygons contained in it that can be reached by a decreasing path (attainability problem), and we show that this can be done by a finite application of "pull-in" moves (bang-bang problem). In the case of triangles, this problems was investigated by Goodman, Johansen, Ramsey, and Frydman among others, in connection with the embeddability problem for non-homogeneous Markov processes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。