This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revision | Next revisionBoth sides next revision | ||
graduation_projects [2018/12/20 12:35] – administrator | graduation_projects [2021/06/06 14:26] – [Nearest-neighbour-preserving sets of space-filling curves (BM)] administrator | ||
---|---|---|---|
Line 20: | Line 20: | ||
Similar to the project mentioned above, we would design an algorithm to search a space of possible designs guided by feedback solicited from the user. However, in this project, it is not building designs we want to explore, but schematizations of public transportation networks, in order to find a most appealing design for a schematized map. | Similar to the project mentioned above, we would design an algorithm to search a space of possible designs guided by feedback solicited from the user. However, in this project, it is not building designs we want to explore, but schematizations of public transportation networks, in order to find a most appealing design for a schematized map. | ||
- | ====Nearest-neighbour-preserving sets of space-filling curves (BM)==== | ||
- | A space-filling curve is essentially a continuous, surjective function //f// from the unit interval to some two- or higher-dimensional volume. As //t// goes from 0 to 1, the image // | ||
- | |||
- | That guarantee is not as good as we would like it to be, and this may have something to do with the following fact: at many points of the space-filling curves used by Liao et al., 2< | ||
====Quantifying the roughness of space-filling curves (M)==== | ====Quantifying the roughness of space-filling curves (M)==== |