  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.
