2026-07-21T23:34:30Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:12239 2024-03-06T10:49:47Z ddc:004 open_access

Plane-Filling Trails (Media Exposition) Haverkort, Herman space-filling curve plane-filling curve spatial indexing 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Herman Haverkort 2020 Is Part Of LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.SoCG.2020.81 urn:nbn:de:0030-drops-122396 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.81 eng https://creativecommons.org/licenses/by/3.0/legalcode