This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revisionNext revisionBoth sides next revision | ||
graduation_projects [2018/10/15 09:33] – [Enhancing schematic maps with zones (M)] administrator | graduation_projects [2021/06/06 14:27] – [Quantifying the roughness of space-filling curves (M)] 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)==== | ||
- | 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 // | ||
====Sonifying algorithms (BM)==== | ====Sonifying algorithms (BM)==== | ||
Line 56: | Line 50: | ||
To bring more structure into the map, we may experiment with the following approach: first identify which metro lines, or which sections thereof, are most important; then adapt the force-directed method such that these lines are drawn straighter or smoother, while allowing less important lines to become more twisted. | To bring more structure into the map, we may experiment with the following approach: first identify which metro lines, or which sections thereof, are most important; then adapt the force-directed method such that these lines are drawn straighter or smoother, while allowing less important lines to become more twisted. | ||
+ | =====Past projects (TUE) ===== | ||
- | =====Current | + | Below you find a list of projects |
====Identifying clusters of parallel linear features for roadway modelling (M)==== | ====Identifying clusters of parallel linear features for roadway modelling (M)==== | ||
- | Wouter van der Stoel is doing his graduation project at the research laboratories of Audi in Ingolstadt. His task is to design an algorithm to determine relations between linear roadway features (such as lane markings and crash barriers): a highly-automated vehicle could use this to build a model of how many lanes there are and where they split or merge. We keep in touch about the progress of his project by regular conference calls with Wouter, me, and his advisors at Audi. | + | Wouter van der Stoel did his graduation project at the research laboratories of Audi in Ingolstadt. His task was to design an algorithm to determine relations between linear roadway features (such as lane markings and crash barriers): a highly-automated vehicle could use this to build a model of how many lanes there are and where they split or merge. We kept in touch about the progress of his project by regular conference calls with Wouter, me, and his advisors at Audi. |
- | + | ||
- | + | ||
- | =====Past projects (TUE) ===== | + | |
- | + | ||
- | Below you find a list of projects that I supervised when I worked at the Eindhoven University of Technology. | + | |
==== Algorithms for space planning in architecture (M)==== | ==== Algorithms for space planning in architecture (M)==== | ||
Line 86: | Line 76: | ||
==== Enhancing schematic maps with zones (M)==== | ==== Enhancing schematic maps with zones (M)==== | ||
- | Schematic maps of transportation networks are designed to show the connections between different train or metro lines clearly. Roel van Happen investigated an approach to construct zone boundaries around groups of stations on such maps, to give the user more information about which stations lie close to each other and which stations do not. His approach is based on an energy function, which, for each zone, gives high values to points that are close to a station within the zone, while giving low values | + | Schematic maps of transportation networks are designed to show the connections between different train or metro lines clearly. Roel van Happen investigated an approach to construct zone boundaries around groups of stations on such maps, to give the user more information about which stations lie close to each other and which stations do not. His approach is based on an energy function, which, for each zone, gives high values to points that are close to a station within the zone, while reducing the values |
==== Embedding travel time cues in schematic maps (M)==== | ==== Embedding travel time cues in schematic maps (M)==== | ||
- | (Michel Cijsouw) I'm updating | + | Michel Cijsouw |
====Simple I/ | ====Simple I/ |