Text Source: / Space-Filling Curvesġ- Fractal charm: Space filling curves /Youtube / 3Blue1Brownġ- Basics (13 Hr 30 Min) 1- What is Grasshopper3d? (2 Hr) 2- Attractors (6 Hr) 3- Rails & Sections (3 Hr) 4- Data Management (2 Hr 30 Min) 2- Geometry(16 Hr 45 Min) 1- Voronoi & Voxel(1 Hr 50 Min) 2- Meshes(1 Hr 45 Min) 3- 2D Patterns(4 Hr) 4- 3D Patterns(2 Hr) 5- Mathematical(2 Hr 20 Min) 6- Fab. Space-filling curves are also used for low-dimensional problems as in the case of the traveling salesperson problem.įor instance, they are used to index meshes for parallel and distributed computing and to organize and process raster data, e.g., images, terrains, and volumetric data. Solving such a problem typically involves searching and sorting in the one-dimensional space.Ī common application of space-filling curves is storage and retrieval of multi-dimensional data in a database.
In general, space-filling curves allow one to reduce higher-dimensional proximity problems, e.g., nearest neighbor search, to a one-dimensional problem. The Euclidean traveling salesperson problem is the problem of finding the shortest closed tour through a set of points. A space-filling curve maps a 1-dimensional space onto a higher-dimensional space, e.g., the unit interval onto the unit square.
0 kommentar(er)
