@tvdmaps

Assistant Prof @ TU Eindhoven, doing computer science and geo stuff. Profile picture by Vincent van den Hoogen

 Eindhoven, The Netherlands
youtube.com/@tvdmaps
Joined November 2017
  • Tweets119
  • Following152
  • Followers70
60Media
Anybody on here going to be at Schematic Mapping Workshop in Paris this year? How about drinks on Wednesday evening? (Posting in case anybody is even here anymore; find me as tvdmaps on sky app.)
1
1
47
This is the dream… thousands of dollars of equipment, tooting on a bizarre doohickey, making music that sounds like frogs listen to it…
1,267
6,329
1,155
67,280
3,105,465
Word of the day: Poissonize. ("In some of the proofs it is useful to Poissonize.")
54
Come work with me? I have a fully funded PhD vacancy "Algorithm Engineering" at TU Eindhoven.
1
1
2
184
more replies
The PhD TA position is for 5 years with 25% of your time spent on education. Full vacancy text and application link here: edu.nl/btffq
1
1
126
Hear me talk about it: youtu.be/dGQ9U_nBXe4
62
Pet peeve: people saying Java doesn't have pointers. Java ONLY has pointers!* Stop making people be scared of pointers.
1
55
(* Java does have primitive types, of course. But calling something a "reference type" doesn't make it not a pointer.)
44
What did they do to Tim?! 😱
1
57
People tend to get the Turing Test slightly wrong – I think. tvd.win.tue.nl/posts/turing-…
52
Kein Grund sich an das Fahr- und Parkverbot zu halten, wenn man trocken zum Bäcker kommen möchte. In @bochum_de sehen die Verkehrsüberwachung und die Polizei großzügig weg oder nutzen im Falle der Polizei (@polizei_nrw_bo) vermeintliche Sonderrechte beim Einkauf.
2
1
17
370
Thomas van Dijk retweeted
Bert Spaan@bertspaan26 Oct 2023
📍With just a few lines of code, you can now overlay historic maps on a @LeafletJS map with the new Allmaps plugin. See observablehq.com/@allmaps/le… to try it out‼️
3
63
4
289
27,788
Thomas van Dijk retweeted
Ludovic Moncla@MonclaLudovic26 Oct 2023
The program of the 7th ACM SIGSPATIAL International Workshop on Geospatial Humanities (#GeoHumanities23) is now online: ludovicmoncla.github.io/sigs… See you in Hamburg @SIGSPATIAL_GIS on November 13 w/ @khetiwe24 @bgmartins @hu_xuke
4
1
6
1,651
Thomas van Dijk retweeted
René Westerholt@rwesterh8717 Oct 2023
Time for another RAM Colloquium! Thomas van Dijk (@tvdmaps) will discuss how to improve geovisualisation through mathematical optimisation. The full abstract is in the image below. Fr, 8 December, 10am CET Hybrid (GBIII/214 and on Zoom) Registration: forms.gle/DyVAethew9g349Gd8
1
1
6
724
Thomas van Dijk retweeted
Yaoyi Chiang@yaoyichiang8 Oct 2023
Want to know more about searching Text on Maps at davidrumsey.com? Come see the mapKurator demo at #sigspatial2023 in Hamburg! @jina_kimmm
1
1
347
🚂 All aboard! Station to Station is leaving the station Play the game now on Steam!
29
81
32
396
137,478
I had a great time at #GIScience in Leeds last week! Check out my talk about visualising geophylogenies (video link below) or get the open access full text here: drops.dagstuhl.de/opus/front…
Title slide with "GIScience 2023, Leeds, full paper: Visualising Geophylogenies" and a picture of a phylogenetic tree next to a map.

ALT Title slide with "GIScience 2023, Leeds, full paper: Visualising Geophylogenies" and a picture of a phylogenetic tree next to a map.

1
60
Here are the main results. • Formalise the problem • Efficient algorithm for internal labeling • Crossing minimisation is NP-hard, but can be solved efficiently with an ILP or heuristics.
Slide: Formalising the problem. Input: Binary tree T with leaves L(T) representing biological taxa / Set of point sites S in an axis aligned rectangle R / One-to-one correspondence between leaves and sites. // Drawing: Leaves are equally spaced at the top border of R / Tree is downward planar, above R. // Optimise: ...?

ALT Slide: Formalising the problem. Input: Binary tree T with leaves L(T) representing biological taxa / Set of point sites S in an axis aligned rectangle R / One-to-one correspondence between leaves and sites. // Drawing: Leaves are equally spaced at the top border of R / Tree is downward planar, above R. // Optimise: ...?

Slide demonstrating leaf-additive quality measures for internal labeling. They can be optimised in O(n squares) time, but counting leader crossings is not leaf additive.

ALT Slide demonstrating leaf-additive quality measures for internal labeling. They can be optimised in O(n squares) time, but counting leader crossings is not leaf additive.

Plot of experimental results showing that the ILP is fast: up to about 60 nodes can be solved in one second; 100 nodes takes more like 10 seconds.

ALT Plot of experimental results showing that the ILP is fast: up to about 60 nodes can be solved in one second; 100 nodes takes more like 10 seconds.

Slide about outlook: Recommendations - ILP works well for minimising leader crossings and the heuristics are also fine. Future work: other leader styles, other feature shapes, other objective functions. And make it useful for biologists. Finally, inspire you to consider combinatorial optimisation for visualisation!

ALT Slide about outlook: Recommendations - ILP works well for minimising leader crossings and the heuristics are also fine. Future work: other leader styles, other feature shapes, other objective functions. And make it useful for biologists. Finally, inspire you to consider combinatorial optimisation for visualisation!

1
1
47
Visualizing Geophylogenies – Internal and External Labeling with Phylogenetic Tree Constraints; with Jonathan Klawitter, Joris Y. Scholl, Felix Klesen, Alexander Zaft youtube.com/watch?v=XJ7hpUu-…
51
Load more