diff --git a/siteupdate/cplusplus/classes/GraphGeneration/PlaceRadius.cpp b/siteupdate/cplusplus/classes/GraphGeneration/PlaceRadius.cpp index 5934e665..1bee516a 100644 --- a/siteupdate/cplusplus/classes/GraphGeneration/PlaceRadius.cpp +++ b/siteupdate/cplusplus/classes/GraphGeneration/PlaceRadius.cpp @@ -84,8 +84,10 @@ std::unordered_set PlaceRadius::v_search(WaypointQuadtree *qt, Highwa // we search for vertices within this quadrant if (!qt->refined()) { for (Waypoint *p : qt->points) - if ((!p->colocated || p == p->colocated->front()) && contains_vertex(p->lat, p->lng)) - vertex_set.insert(g->vertices.at(p)); + if ( (!p->colocated || p == p->colocated->front()) + && p->is_or_colocated_with_active_or_preview() + && contains_vertex(p->lat, p->lng) + ) vertex_set.insert(g->vertices.at(p)); } // if we're not a terminal quadrant, we need to determine which // of our child quadrants we need to search and recurse into each diff --git a/siteupdate/python-teresco/siteupdate.py b/siteupdate/python-teresco/siteupdate.py index c5f1d7ac..2ab13dec 100755 --- a/siteupdate/python-teresco/siteupdate.py +++ b/siteupdate/python-teresco/siteupdate.py @@ -1569,7 +1569,7 @@ def v_search(self, qt, g, w_bound, e_bound): # we search for vertices within this quadrant if qt.points is not None: for p in qt.points: - if (p.colocated is None or p == p.colocated[0]) and self.contains_vertex(p): + if (p.colocated is None or p == p.colocated[0]) and p.is_or_colocated_with_active_or_preview() and self.contains_vertex(p): vertex_set.add(g.vertices[p]) # if we're not a terminal quadrant, we need to determine which # of our child quadrants we need to search and recurse into each