License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SoCG.2020.81
URN: urn:nbn:de:0030-drops-122396
Go to the corresponding LIPIcs Volume Portal

Haverkort, Herman

Plane-Filling Trails (Media Exposition)

LIPIcs-SoCG-2020-81.pdf (5 MB)


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.

BibTeX - Entry

  author =	{Herman Haverkort},
  title =	{{Plane-Filling Trails (Media Exposition)}},
  booktitle =	{36th International Symposium on Computational Geometry (SoCG 2020)},
  pages =	{81:1--81:5},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-143-6},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{164},
  editor =	{Sergio Cabello and Danny Z. Chen},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-122396},
  doi =		{10.4230/LIPIcs.SoCG.2020.81},
  annote =	{Keywords: space-filling curve, plane-filling curve, spatial indexing}

Keywords: space-filling curve, plane-filling curve, spatial indexing
Collection: 36th International Symposium on Computational Geometry (SoCG 2020)
Issue Date: 2020
Date of publication: 08.06.2020
Supplementary Material: For software and additional figures visit

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI