How to do a initial test for 'Cleveland' problem

[BITcats]

Thank for your outstanding works. I am currently working on utilizing your library to address the Cleveland problem, and I've encountered some challenges when I do a initial test for the 'Cleveland' problem with the code from the branch 'cleveland'. I was wondering if you could provide guidance on recommended methods for conducting initial tests on the Cleveland problem.

The two videos in the README provide some useful guidance. I attempted to make some modifications to the code, but I cannot guarantee if they are correct.

• I replaced lines 23 and 24 in the 'cleveland14a-default-data.h' file with the following code:

static F l_[io::pp::nviews][io::ncoords2d_h];
static const F l_correct_[io::pp::nviews][io::ncoords2d_h];

• I noticed that 'cleveland14a-default-data.hxx' lacks data about a free line. What can I do to fill it?
• What additional tasks do I need to perform to ensure './minus-cleveland -g' can run correctly?

[h1063135843]

Same problem, why print_usage in minus-chicago and minus-cleveland output same content? Does it means both problem take 3 points and tangents as input？ But it is said in paper that the cleveland problem handles with 3 points and 1 free line.