Plane-filling trails
Computational Geometry
2020-03-31 v1 Metric Geometry
Abstract
The order in which plane-filling curves visit points in the plane can be exploited to design efficient algorithms. Typically, the curves are useful because they preserve locality: points that are close to each other along the curve tend to be close to each other in the plane, and vice versa. However, sketches of plane-filling curves do not show this well: they are hard to read on different levels of detail and it is hard to see how far apart points are along the curve. This paper presents a software tool to produce compelling visualisations that may give more insight in the structure of the curves.
Cite
@article{arxiv.2003.12745,
title = {Plane-filling trails},
author = {Herman Haverkort},
journal= {arXiv preprint arXiv:2003.12745},
year = {2020}
}
Comments
Full version (9 pages) of a submission that is conditionally accepted to the 2020 Computational Geometry Week Media Exposition