1 paper
Dominique Laurain, Peter Moses, Dan Reznik
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…