Make sure insects never miss something by flying over it
@mlange @nolzen Implemented in a two step process:
-
The first commit modifies my K-D tree implementation to perform an abstract query instead of within-distance-to-point. It does not change the behaviour though and and provides a
WithinDistance
query that considers all points within a given distance of a single point. -
The second commit replaces the implementation of that query by one that takes two points and considers all points within a given distance of the thereby defined line segment by projecting any position onto it. Is then used to query all points within the visibility range from the current position to the new position at the end of the tick.