On Wed, Apr 21, 2010 at 2:08 PM, Boyko Bantchev <[email protected]> wrote: > 0. Choose any vertex B as a base point. Consider the two rays, > r1 and r2, from B through the neighbouring vertices. Check > if P is between the rays (left of r1, right of r2). If it is
How are r1 and r2 chosen? If chosen incorrectly, they can both be on one side of B even though other points in the polygon are not, leading to a false conclusion. If you have to examine all the points in the polygon before testing B then the algorithm can not be O(log n). -- Raul ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
