Papers › Interlaced scan patterns based on progressive hexagonal grids
Interlaced scan patterns based on progressive hexagonal grids
Jacob D. Hinkle, Debangshu Mukherjee
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Progressive acquisition of slowly-scanned images is desirable for drift correction and real-time visualization. Interlacing methods are common approaches to storing and transmitting data on rectilinear grids, and here we propose using them for acquisition in scanning-mode image modalities. Especially in these cases, it is essential to make optimal use of sample points to speed up the scan and reduce damage to the subject. It has long been known that optimal sampling of band-limited signals is achieved using hexagonal scanning grids. In this note, we demonstrate two new methods for interlacing hexagonal grids, which enable early full field-of-view imaging with optimal sampling and resolution doubling.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections