0
$\begingroup$

On finding a minimal enclosing parallelogram

I think the problem will occur when we only consider the first clockwise antipodal vertex. I think instead we should consider an edge when there are two possible antipodal vertices w.r.t an edge.

I give two examples here. Can somebody help me verify it?

flaw1 flaw2

$\endgroup$
1
  • $\begingroup$ Welcome to CS.SE! We expect references to fulfill the minimal scholarly requirements and be as robust over time as possible. Please take some time to improve your post in this regard. We have collected some advice here. Hopefully this will help others who have a similar question about this paper to find your post by search. Thank you! $\endgroup$ – D.W. Nov 6 '20 at 7:10

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.