2020/03/28 by Herman Haverkort, Haverkort, Herman
Computer Science · #Algorithms and Data Compression #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #FOS: Computer and information sciences #FOS: Mathematics #Metric Geometry (math.MG) #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.2003.12745
openalex publication_date 2020/03/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.