Dave is right that Bentley Ottmann is a good choice. It is O(n*log n)
which is an improvement over a simplistic approach which would be
O(n^2). Do be careful in implementation to ensure that it catches
cases where two points are coincident or one edge passes exactly
through another vertex. I saw
@Shady: See http://en.wikipedia.org/wiki/Bentley%E2%80%93Ottmann_algorithm.
Dave
On Sunday, January 20, 2013 10:02:19 AM UTC-6, shady wrote:
How to check if polygon is simple based on given list of points ?
--
