Check if there is a convex quadrilateral from a given set of points

Revision en2, by tttt4444, 2021-12-04 17:07:04

You are given a set of points with their integer coordinates. You need to determine if there are convex quarilaterals in at most O(n^2) time.

For example: 5 2 2 5 3 8 2 7 6 4 7 Has

5 2 2 7 6 7 4 9 4 10 4 Has not

Thank you for your help!

Tags geometry, computational geometry, algorithm

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English tttt4444 2021-12-04 17:07:04 0 (published)
en1 English tttt4444 2021-12-04 17:06:36 329 Initial revision (saved to drafts)