You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
// Check to see if a neighbor is higher than the query point
148
156
float query_z = (*input_)[iii].z;
149
-
for (std::size_t k = 1; k < radius_indices.size (); ++k) //k = 1 is the first neighbor
157
+
for (std::size_t k = 0; k < radius_indices.size (); ++k) //the query point itself is in the (unsorted) radius_indices, but that is okay since we compare with ">"
// visited, excluding them from future consideration as local maxima
161
169
if (point_is_max[iii])
162
170
{
163
-
for (std::size_t k = 1; k < radius_indices.size (); ++k) //k = 1 is the first neighbor
171
+
for (std::size_t k = 0; k < radius_indices.size (); ++k) //the query point itself is in the (unsorted) radius_indices, but it must also be marked as visited
0 commit comments