コード例 #1
0
        if not self.boundary.intersects(range):
            return
        else:
            for p in self.points:
                if range.contains(p):
                    found.push(p)
                if self.divided:
                    self.northwest.query(range, found)
                    self.northeast.query(range, found)
                    self.southwest.query(range, found)
                    self.southeast.query(range, found)
        return found


    def addMarkers(self, points):
        for p in points:
            marcador = folium.Marker(location=(coor[1], coor[0]),
                                      icon = folium.Icon(color = "red"))
            marker.add_to(map)


boundary = Rectangle(-75.5579529, 6.3373199, 0.1, 0.07)
quadtree = Quadtree(boundary, 4)
coordinates = Coordinates('../datasets/ConjuntoDeDatosCon100abejas.csv')

for coordinate in coordinates.getCoordinates():
    p = Point(coordinate[0], coordinate[1])
    quadtree.insert(p)

map.save("map.html")