The Cramer-Castillon problem (CCP) consists in finding one or more polygons inscribed in a circle such that their sides pass cyclically through a list of $N$ points. We study this problem where the points are the vertices of a triangle and the circle is either the incircle or excircles.
翻译:Cramer-Cashillon问题(CCP)在于找到一个或数个圆圈中标注的多边形,以便它们的两边通过一个美元点的列表周期性地通过。 我们研究这个问题,这里的点是三角形的顶点,圆要么是圆圈,要么是弧形。