We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
This is indeed a subproblem of the Convex Hall Problem. Most of the Convex Hall Algorithm uses a function to determine whether consecutive 3 points are counter-clockwise or not. This problem can be solved by using this counter-clockwise function after sorting points (for example, by polar angle)
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Concave Polygon
You are viewing a single comment's thread. Return to all comments →
This is indeed a subproblem of the Convex Hall Problem. Most of the Convex Hall Algorithm uses a function to determine whether consecutive 3 points are counter-clockwise or not. This problem can be solved by using this counter-clockwise function after sorting points (for example, by polar angle)