Plane-Filling Trails (Media Exposition)

DOI10.4230/LIPICS.SOCG.2020.81MaRDI QIDQ6060044zbMATH OpenOpenAlexFDO

Authors Herman Haverkort

Publication date 2 November 2023

Full work available at URL https://arxiv.org/abs/2003.12745

zbMATH Keywords

plane-filling curvespace-filling curvespatial indexing

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Computer science aspects of computer-aided design (68U07) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

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.

Recommendations

• Locality and bounding-box quality of two-dimensional space-filling curves
• Space-filling curves in tool-path applications
• Spacefilling curves and the planar travelling salesman problem
• Locality and Bounding-Box Quality of Two-Dimensional Space-Filling Curves
• Algorithms and Computation

This page was built for publication: Plane-Filling Trails (Media Exposition)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6060044)