Freek van Walderveen

Cur­rent­ly work­ing at SCAL­GO on de­sign and im­ple­men­ta­tion of al­go­rithms for hy­dro­log­i­cal ap­pli­ca­tions. I re­ceived my PhD from the Uni­ver­si­ty of Aarhus, where I was a PhD stu­dent at the MADAL­GO re­search cen­ter. I am in­ter­est­ed in al­go­rith­mics in gen­er­al, and espe­cial­ly I/O-ef­fi­cient ge­o­met­ric and graph al­go­rithms. I re­ceived my mas­ter de­gree from the Eind­hoven Uni­ver­si­ty of Tech­nol­o­gy.

In my spare time I'm an ac­tive con­trib­u­tor to the Open­StreetMap pro­ject, pro­vid­ing street-level maps with source data and many in­ter­est­ing de­tails, all un­der a friend­ly li­cence.

Contact information

Publications

• Com­put­ing be­tween­ness cen­tral­i­ty in ex­ter­nal mem­o­ry
  With Lars Arge and Michael T. Goodrich.
  In 2013 IEEE In­ter­na­tion­al Con­fer­ence on Big Data (Big­Data 2013), Oc­to­ber 2013.
  PDF
  
  
• Mul­ti­way sim­ple cy­cle sep­a­ra­tors and I/O-ef­fi­cient al­go­rithms for pla­nar graphs
  With Lars Arge and Nor­bert Zeh.
  In 24th ACM-SI­AM Sym­po­sium on Dis­crete Al­go­rithms (SO­DA'13), pages 901–918, Jan­uary 2013.
  Pre­sen­ta­tion
  
  
• Near-op­ti­mal range re­port­ing struc­tures for cat­e­gor­i­cal data
  With Kasper Green Larsen.
  In 24th ACM-SI­AM Sym­po­sium on Dis­crete Al­go­rithms (SO­DA'13), pages 265–276, Jan­uary 2013.
  
  
• Two-di­men­sion­al range di­am­e­ter queries
  With Pooya Davoodi and Michiel Smid.
  In 10th Lat­in Amer­i­can Sym­po­sium on The­o­ret­i­cal In­for­mat­ics (LAT­IN2012), LNCS 7256, pages 219–230, April 2012.
  Pre­sen­ta­tion
  
  
• Clean­ing mas­sive sonar point clouds
  With Lars Arge, Kasper Green Larsen, and Thomas Mølhave.
  In 18th ACM SIGSPA­TIAL GIS, pages 152–161, Novem­ber 2010.
  Pre­sen­ta­tion
  
  
• Con­structabil­i­ty of trip-lets
  With Jeroen Keiren and Alexan­der Wolff.
  In 25th Eu­ro­pean Work­shop on Comp­uta­tion­al Ge­om­e­try (Eu­roCG 2009), pages 251–254, March 2009.
  Pre­sen­ta­tion
  
  
• Four-di­men­sion­al Hilbert curves for R-trees
  With Her­man Haver­ko­rt.
  In 11th Work­shop on Al­go­rithm En­gin­eer­ing and Ex­per­i­ments (ALENEX'09), pages 63–73, Jan­uary 2009.
  Jour­nal ver­sion in ACM Jour­nal on Ex­per­i­men­tal Al­go­rith­mics 16, ar­ti­cle 3.4, May 2011.
  
  
• Loc­al­i­ty and bound­ing-box qual­i­ty of two-di­men­sion­al space-fill­ing curves
  With Her­man Haver­ko­rt.
  In 16th An­nu­al Eu­ro­pean Sym­po­sium on Al­go­rithms (ESA 2008), LNCS 5193, pages 515–527, Septem­ber 2008.
  Pre­sen­ta­tion
  Jour­nal ver­sion in Com­pu­ta­tion­al Ge­om­e­try: The­o­ry and Ap­pli­ca­tions 43:2, pages 131–147, Febru­ary 2010.
  
  
• Space-fill­ing curve prop­er­ties for ef­fi­cient spa­tial in­dex struc­tures
  With Her­man Haver­ko­rt.
  In 24th Eu­ro­pean Work­shop on Comp­uta­tion­al Ge­om­e­try (Eu­roCG 2008), pages 51–54, March 2008.
  This is an ex­tend­ed ab­stract of the re­sults in Loc­al­i­ty and bound­ing-box qual­i­ty of two-di­men­sion­al space-fill­ing curves and Four-di­men­sion­al Hilbert curves for R-trees.