Skip to content

Nodianosh class#7

Open
IvaNodyanosh wants to merge 3 commits intomainfrom
nodianosh-class
Open

Nodianosh class#7
IvaNodyanosh wants to merge 3 commits intomainfrom
nodianosh-class

Conversation

@IvaNodyanosh
Copy link
Copy Markdown
Collaborator

No description provided.

jbrezmorf and others added 3 commits April 7, 2026 12:34
Added TODO comments for future improvements and clarifications regarding parameters and functionality.
# Vygenerujeme body a roztáhneme je na rozměry bounding boxu
points = engine.random(self.count_points)
return self.area_stats["min"] + points * self.area_stats["sides"]
except Exception:
Copy link
Copy Markdown
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Neodchytávat.

k = min(10, len(self.anchor_points))

distances, indices = tree.query(self.point_coords, k=k, distance_upper_bound=r_limit)

Copy link
Copy Markdown
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Comment it arrays of shape (len(point_coords), k).

final_indices = []
for i in range(len(self.point_coords)):
# cKDTree vrací 'inf' a index == len(data) pro nenalezené sousedy
idx = indices[i]
Copy link
Copy Markdown
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

idx -> candidate_indices

valid = idx < len(self.anchor_points)
final_indices.append(idx[valid])

return final_indices
Copy link
Copy Markdown
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

List[List[int]]

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants