0.1.5

Mounted Digital Miner scan pool behavior now tracks the moving scan volume more closely.

• Queued mining targets outside the miner's current radius/Y scan box are removed as the airship moves.
• Pending scan jobs and remembered ticket chunks outside the current scan box are pruned before each scan pass.
• Trail scan samples are clipped to the current scan box, so movement still fills newly entered areas without keeping old out-of-range targets in the visible To Mine pool.
• Chunk tickets continue to prioritize the current scan footprint and no longer retain stale recent chunks outside that footprint.

Algorithm notes:

• The mounted scanner treats the Digital Miner volume as the current projected world-space scan box, not as a permanent trail of every chunk the ship has crossed.
• Before each scan pass, the queue, section jobs, trail anchors, and remembered chunk-ticket history are clipped against the current scan bounds.
• Chunk-section scanning still skips unloaded sections, empty sections, and palette-impossible sections before walking block states.
• The fast scan path remains budgeted by the configured position batch limit and soft time budget, so movement updates the visible pool without creating unbounded scan work.

Research references used while choosing the scan shape:

• John Amanatides and Andrew Woo, "A Fast Voxel Traversal Algorithm for Ray Tracing" (1987): https://doi.org/10.2312/egtp.19871000
• Samuli Laine and Tero Karras, "Efficient Sparse Voxel Octrees" (2010): https://research.nvidia.com/publication/2010-02_efficient-sparse-voxel-octrees
• Samuli Laine and Tero Karras, "Efficient Sparse Voxel Octrees - Analysis, Extensions, and Implementation" (2010): https://research.nvidia.com/publication/2010-02_efficient-sparse-voxel-octrees-analysis-extensions-and-implementation