optimization.search¶

Where the references sit, searched on a grid: one reference at a time, the best plan kept.

Functions

`search_references`(problem, anchors, radius, ...)	Search the parameters in `anchors` (name → point) over the grid points of the balls of `radius` [m] around them, `step` [m] apart.
`sphere_points`(center, radius, step)	The grid points `step` apart inside the ball of `radius` around `center`, the center first, then by distance.

Classes

`Search`(result, references, candidates)	The best plan found, the references that gave it, and every point tried.