Plane-filling trails

03/28/2020
by   Herman Haverkort, et al.
0

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.

READ FULL TEXT

page 3

page 4

page 7

page 8

research
07/17/2018

Counting higher order tangencies for plane curves

We prove that n plane algebraic curves determine O(n^(k+2)/(k+1)) points...
research
05/09/2018

Computing basepoints of linear series in the plane

We present an algorithm for detecting basepoints of linear series of cur...
research
06/14/2020

Repulsive Curves

Curves play a fundamental role across computer graphics, physical simula...
research
08/09/2018

A note on partial rejection sampling for the hard disks model in the plane

In this note, we slightly improve the guarantees obtained by Guo and Jer...
research
07/05/2019

A new method for determining the filled point of the tooth by Bit-Plane Algorithm

Up to now, researchers have applied segmentation techniques in their stu...
research
05/23/2022

Recovery of Plane Curves from Branch Points

We recover plane curves from their branch points under projection onto a...
research
08/04/2023

Online Obstacle evasion with Space-Filling Curves

The paper presents a strategy for robotic exploration problems using Spa...

Please sign up or login with your details

Forgot password? Click here to reset