Site Tools


graduation_projects

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision
Previous revision
Next revisionBoth sides next revision
graduation_projects [2018/10/16 11:17] – [Embedding travel time cues in schematic maps (M)] administratorgraduation_projects [2018/12/20 12:35] administrator
Line 56: Line 56:
 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 projects=====+Below you find a list of projects that I supervised or co-supervised when I worked at the Eindhoven University of Technology.
  
 ====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 91: Line 87:
 ==== Embedding travel time cues in schematic maps (M)==== ==== Embedding travel time cues in schematic maps (M)====
  
-Michel Cijsouw experimented with improving the usability of schematic metro maps by emphasizing railway sections that are used more oftenEmphasis is created by making such sections thicker and by creating more space for them on the map. To this end, Michel worked with an existing mixed-integer programming formulation that aims to describe the optimal map, and adapted this formulation to take requirements for additional space into account.+Michel Cijsouw experimented with improving the usability of schematic metro maps. To this end, he wrote algorithms that emphasize railway sections depending on the number of destinations for which these sections are part of the shortest routeThe required emphasis is created by drawing railway sections with thicker strokes and by creating more space for them on the map. For this purpose, Michel worked with an existing mixed-integer programming formulation that aims to describe the optimal map, and adapted this formulation to take requirements for additional space into account.
  
 ====Simple I/O-efficient shortest path algorithms (M)==== ====Simple I/O-efficient shortest path algorithms (M)====
graduation_projects.txt · Last modified: 2021/06/06 14:30 by administrator