Contains point

[angelsolaorbaiceta]

Contains point

[angelsolaorbaiceta]

Hi there!

Thanks a lot for your kind words. Happy to hear you're enjoying the book.

The case you're describing should definitely work; there might be a bug somewhere in the code.

Would you be so nice as to include a small snippet of code that reproduces the error you describe? I'm currently out from home without a laptop to work, but as soon as I get back I'll take a look at this.

Best,
Ángel

[kylepritchard]

Hi,

I looked a little more today when time allowed and I was slightly wrong about the square/rectangle issue. The only issue I see is with the way the points of the polygon are listed. In my testing the polygon points were added moving clockwise through the polygon hence the angles always ended up negative which yields a failure as the test case is limited to positive angles. I'm not sure if it is conventional to list the points in counter-clockwise manner or if the algorithm should take that into account by checking the absolute value of the angle sum? I modified the test file slightly to illustrate the case.

class TestPolygon(unittest.TestCase):
    vertices = [
        Point(0, 0),
        Point(30, 0),
        Point(0, 30),
    ]

    polygon_1 = Polygon(vertices)

    def test_contains_point_polygon_1(self):
        point = Point(10, 10)
        self.assertTrue(self.polygon_1.contains_point(point))

    vertices_2 = [
        Point(0, 0),
        Point(0, 30),
        Point(30, 0),
    ]

    polygon_2 = Polygon(vertices_2)

    def test_contains_point_polygon_2(self):
        point = Point(10, 10)
        self.assertTrue(self.polygon_2.contains_point(point))  <== Fails (FALSE)

The test will fail on polygon_2 which is the same polygon with the points listed in reverse order.