default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWouter Meulemans
Person information
- affiliation: Eindhoven University of Technology, Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c46]Steven van den Broek, Wouter Meulemans, Andreas Reimer, Bettina Speckmann:
Scalable Harmonious Simplification of Isolines. COSIT 2024: 8:1-8:20- [c45]Nathan van Beusekom, Wouter Meulemans, Bettina Speckmann:
Contextual Matrix Orderings for Graph Collections. PacificVis 2024: 182-191 - [c44]Bernd Gärtner, Vishwas Kalani, Meghana M. Reddy, Wouter Meulemans, Bettina Speckmann, Milos Stojakovic:
Optimizing Symbol Visibility Through Displacement. SWAT 2024: 24:1-24:16 - [i24]Steven van den Broek, Wouter Meulemans, Bettina Speckmann:
Greedy Monochromatic Island Partitions. CoRR abs/2402.13340 (2024) - [i23]Steven van den Broek, Wouter Meulemans, Bettina Speckmann:
SimpleSets: Capturing Categorical Point Patterns with Simple Shapes. CoRR abs/2407.14433 (2024) - 2023
- [c43]Nathan van Beusekom, Wouter Meulemans, Bettina Speckmann, Jo Wood:
Data-Spatial Layouts for Grid Maps. GIScience 2023: 10:1-10:17 - [i22]Bernd Gärtner, Vishwas Kalani, Meghana M. Reddy, Wouter Meulemans, Bettina Speckmann, Milos Stojakovic:
Optimizing Symbol Visibility through Displacement. CoRR abs/2310.01147 (2023) - 2022
- [j22]Michael A. Bekos
, D. J. C. Dekker, F. Frank, Wouter Meulemans, Peter J. Rodgers, André Schulz, S. Wessel:
Computing Schematic Layouts for Spatial Hypergraphs on Concentric Circles and Grids. Comput. Graph. Forum 41(6): 316-335 (2022) - [j21]Pantea Haghighatkhah, Wouter Meulemans, Bettina Speckmann, Jérôme Urhausen, Kevin Verbeek:
Obstructing Classification via Projection. Comput. Geom. Topol. 1(1): 2:1-2:21 (2022) - [j20]Nathan van Beusekom, Wouter Meulemans, Bettina Speckmann:
Simultaneous Matrix Orderings for Graph Collections. IEEE Trans. Vis. Comput. Graph. 28(1): 1-10 (2022) - [j19]Soeren Nickel, Max Sondag, Wouter Meulemans, Stephen G. Kobourov, Jaakko Peltonen, Martin Nöllenburg:
Multicriteria Optimization for Dynamic Demers Cartograms. IEEE Trans. Vis. Comput. Graph. 28(6): 2376-2387 (2022) - [c42]Philipp Kindermann, Fabian Klute, Tamara Mchedlidze, Wouter Meulemans:
Graph Drawing Contest Report. GD 2022: 459-470 - [c41]Bram Custers, Wouter Meulemans, Marcel Roeloffzen, Bettina Speckmann, Kevin Verbeek:
Physically consistent map matching. SIGSPATIAL/GIS 2022: 56:1-56:4 - 2021
- [j18]Ivor van der Hoog, Marc J. van Kreveld, Wouter Meulemans, Kevin Verbeek, Jules Wulms:
Topological stability of kinetic k-centers. Theor. Comput. Sci. 866: 145-159 (2021) - [j17]Bram Custers, Mees van de Kerkhof, Wouter Meulemans, Bettina Speckmann, Frank Staals:
Maximum Physically Consistent Trajectories. ACM Trans. Spatial Algorithms Syst. 7(4): 17:1-17:33 (2021) - [j16]Wouter Meulemans, Max Sondag, Bettina Speckmann:
A Simple Pipeline for Coherent Grid Maps. IEEE Trans. Vis. Comput. Graph. 27(2): 1236-1246 (2021) - [c40]Jules Wulms, Juri Buchmüller, Wouter Meulemans, Kevin Verbeek, Bettina Speckmann:
Stable Visual Summaries for Trajectory Collections. PacificVis 2021: 61-70 - [c39]Nathan van Beusekom, Kevin Buchin, Hidde Koerts, Wouter Meulemans, Benjamin Rodatz, Bettina Speckmann:
Near-Delaunay Metrics. CCCG 2021: 1-11 - [c38]Philipp Kindermann, Tamara Mchedlidze, Wouter Meulemans:
Graph Drawing Contest Report. GD 2021: 409-417 - [c37]Bram Custers, Wouter Meulemans, Bettina Speckmann, Kevin Verbeek:
Route Reconstruction from Traffic Flow via Representative Trajectories. SIGSPATIAL/GIS 2021: 41-52 - [c36]Bram Custers, Wouter Meulemans, Bettina Speckmann, Kevin Verbeek:
Coordinated Schematization for Visualizing Mobility Patterns on Networks. GIScience (II) 2021: 7:1-7:16 - [c35]Arthur van Goethem, Wouter Meulemans, Andreas W. Reimer, Bettina Speckmann:
Harmonious Simplification of Isolines. GIScience (II) 2021: 8:1-8:16 - [c34]Pantea Haghighatkhah, Wouter Meulemans, Bettina Speckmann, Jérôme Urhausen, Kevin Verbeek:
Obstructing Classification via Projection. MFCS 2021: 56:1-56:19 - [i21]Pantea Haghighatkhah, Wouter Meulemans, Bettina Speckmann, Jérôme Urhausen, Kevin Verbeek:
Obstructing Classification via Projection. CoRR abs/2105.09047 (2021) - [i20]Nathan van Beusekom, Kevin Buchin, Hidde Koerts, Wouter Meulemans, Benjamin Rodatz, Bettina Speckmann:
Near-Delaunay Metrics. CoRR abs/2106.11621 (2021) - [i19]Nathan van Beusekom, Wouter Meulemans, Bettina Speckmann:
Simultaneous Matrix Orderings for Graph Collections. CoRR abs/2109.12050 (2021) - 2020
- [j15]Jean-Lou De Carufel, Adrian Dumitrescu, Wouter Meulemans, Tim Ophelders, Claire Pennarun, Csaba D. Tóth, Sander Verdonschot:
Convex polygons in cartesian products. J. Comput. Geom. 11(2): 205-233 (2020) - [c33]Max Sondag, Wouter Meulemans, Christoph Schulz, Kevin Verbeek, Daniel Weiskopf, Bettina Speckmann:
Uncertainty Treemaps. PacificVis 2020: 111-120 - [c32]Philipp Kindermann, Tamara Mchedlidze, Wouter Meulemans, Ignaz Rutter:
Graph Drawing Contest Report. GD 2020: 507-519 - [i18]Bram Custers, Wouter Meulemans, Bettina Speckmann, Kevin Verbeek:
Route Reconstruction from Traffic Flow via Representative Trajectories. CoRR abs/2012.05019 (2020)
2010 – 2019
- 2019
- [j14]Wouter Meulemans:
Efficient Optimal Overlap Removal: Algorithms and Experiments. Comput. Graph. Forum 38(3): 713-723 (2019) - [j13]Kevin Buchin, Maike Buchin, Wouter Meulemans, Bettina Speckmann:
Locally correct Fréchet matchings. Comput. Geom. 76: 1-18 (2019) - [j12]Thom Castermans, Mereke van Garderen, Wouter Meulemans, Martin Nöllenburg, Xiaoru Yuan:
Short Plane Supports for Spatial Hypergraphs. J. Graph Algorithms Appl. 23(3): 463-498 (2019) - [j11]Rutger Kraaijer, Marc J. van Kreveld, Wouter Meulemans, André van Renssen:
Geometry and Generation of a New Graph Planarity Game. J. Graph Algorithms Appl. 23(4): 603-624 (2019) - [c31]Jean-Lou De Carufel, Adrian Dumitrescu, Wouter Meulemans, Tim Ophelders, Claire Pennarun, Csaba D. Tóth, Sander Verdonschot:
Convex Polygons in Cartesian Products. SoCG 2019: 22:1-22:17 - [c30]Soeren Nickel, Max Sondag, Wouter Meulemans, Markus Chimani, Stephen G. Kobourov, Jaakko Peltonen, Martin Nöllenburg:
Computing Stable Demers Cartograms. GD 2019: 46-60 - [c29]Onur Derin, Aniket Mitra, Matei Stroila, Bram Custers, Wouter Meulemans, Marcel Roeloffzen, Kevin Verbeek:
Understanding Movement in Context with Heterogeneous Data. MOVE++@SIGSPATIAL 2019: 1:1-1:4 - [c28]Bram Custers, Mees van de Kerkhof, Wouter Meulemans, Bettina Speckmann, Frank Staals:
Maximum Physically Consistent Trajectories. SIGSPATIAL/GIS 2019: 79-88 - [c27]Ivor van der Hoog, Marc J. van Kreveld, Wouter Meulemans, Kevin Verbeek, Jules Wulms:
Topological Stability of Kinetic k-centers. WALCOM 2019: 43-55 - [i17]Wouter Meulemans, Kevin Verbeek, Jules Wulms:
Stability analysis of kinetic orientation-based shape descriptors. CoRR abs/1903.11445 (2019) - [i16]Rutger Kraaijer, Marc J. van Kreveld, Wouter Meulemans, André van Renssen:
Geometry and Generation of a New Graph Planarity Game. CoRR abs/1908.01426 (2019) - [i15]Soeren Nickel, Max Sondag, Wouter Meulemans, Markus Chimani, Stephen G. Kobourov, Jaakko Peltonen, Martin Nöllenburg:
Computing Stable Demers Cartograms. CoRR abs/1908.07291 (2019) - [i14]Jules Wulms, Juri Buchmüller, Wouter Meulemans, Kevin Verbeek, Bettina Speckmann:
Spatially and Temporally Coherent Visual Summaries. CoRR abs/1912.00719 (2019) - 2018
- [j10]Gregor Hültenschmidt, Philipp Kindermann, Wouter Meulemans, André Schulz:
Drawing Planar Graphs with Few Geometric Primitives. J. Graph Algorithms Appl. 22(2): 357-387 (2018) - [j9]Philipp Kindermann, Wouter Meulemans, André Schulz:
Experimental Analysis of the Accessibility of Drawings with Few Segments. J. Graph Algorithms Appl. 22(3): 501-518 (2018) - [c26]Willem Sonke, Kevin Verbeek, Wouter Meulemans, Eric Verbeek, Bettina Speckmann:
Optimal Algorithms for Compact Linear Layouts. PacificVis 2018: 1-10 - [c25]Rutger Kraaijer, Marc J. van Kreveld, Wouter Meulemans, André van Renssen:
Geometry and Generation of a New Graph Planarity Game. CIG 2018: 1-8 - [c24]Mark Alfano, Scott W. Cunningham, Wouter Meulemans, Ignaz Rutter, Max Sondag, Bettina Speckmann, Emily Sullivan:
Social Network-Epistemology. eScience 2018: 320-321 - [c23]Thom Castermans, Mereke van Garderen, Wouter Meulemans, Martin Nöllenburg, Xiaoru Yuan:
Short Plane Supports for Spatial Hypergraphs. GD 2018: 53-66 - [c22]Quirijn W. Bouts, Thom Castermans, Arthur van Goethem, Marc J. van Kreveld, Wouter Meulemans:
Competitive Searching for a Line on a Line Arrangement. ISAAC 2018: 49:1-49:12 - [c21]Wouter Meulemans, Bettina Speckmann, Kevin Verbeek, Jules Wulms:
A Framework for Algorithm Stability and Its Application to Kinetic Euclidean MSTs. LATIN 2018: 805-819 - [i13]Thom Castermans, Mereke van Garderen, Wouter Meulemans, Martin Nöllenburg, Xiaoru Yuan:
Short Plane Supports for Spatial Hypergraphs. CoRR abs/1808.09729 (2018) - [i12]Ivor van der Hoog, Marc J. van Kreveld, Wouter Meulemans, Kevin Verbeek, Jules Wulms:
Topological Stability of Kinetic k-Centers. CoRR abs/1810.00794 (2018) - [i11]Jean-Lou De Carufel, Adrian Dumitrescu, Wouter Meulemans, Tim Ophelders, Claire Pennarun, Csaba D. Tóth, Sander Verdonschot:
Convex Polygons in Cartesian Products. CoRR abs/1812.11332 (2018) - 2017
- [j8]Kevin Buchin, Maike Buchin, Wouter Meulemans, Wolfgang Mulzer:
Four Soviets Walk the Dog: Improved Bounds for Computing the Fréchet Distance. Discret. Comput. Geom. 58(1): 180-216 (2017) - [j7]Alexander Igamberdiev, Wouter Meulemans, André Schulz:
Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms & Experiments. J. Graph Algorithms Appl. 21(4): 561-588 (2017) - [j6]Wouter Meulemans, Jason Dykes, Aidan Slingsby, Cagatay Turkay, Jo Wood:
Small Multiples with Gaps. IEEE Trans. Vis. Comput. Graph. 23(1): 381-390 (2017) - [j5]Roger Beecham, Jason Dykes, Wouter Meulemans, Aidan Slingsby, Cagatay Turkay, Jo Wood:
Map LineUps: Effects of spatial structure on graphical inference. IEEE Trans. Vis. Comput. Graph. 23(1): 391-400 (2017) - [c20]Maarten Löffler, Wouter Meulemans:
Discretized Approaches to Schematization. CCCG 2017: 220-225 - [c19]Kevin Buchin, Jinhee Chun, Maarten Löffler, Aleksandar Markovic, Wouter Meulemans, Yoshio Okamoto, Taichi Shiitada:
Folding Free-Space Diagrams: Computing the Fréchet Distance between 1-Dimensional Curves (Multimedia Contribution). SoCG 2017: 64:1-64:5 - [c18]Benjamin A. Burton, Erin W. Chambers, Marc J. van Kreveld, Wouter Meulemans, Tim Ophelders, Bettina Speckmann:
Computing Optimal Homotopies over a Spiked Plane with Polygonal Boundary. ESA 2017: 23:1-23:14 - [c17]Philipp Kindermann, Wouter Meulemans, André Schulz:
Experimental Analysis of the Accessibility of Drawings with Few Segments. GD 2017: 52-64 - [c16]Arthur van Goethem, Irina Kostitsyna, Marc J. van Kreveld, Wouter Meulemans, Max Sondag, Jules Wulms:
The Painter's Problem: Covering a Grid with Colored Connected Polygons. GD 2017: 492-505 - [c15]Kevin Buchin, Yago Diez, Tom van Diggelen, Wouter Meulemans:
Efficient trajectory queries under the Fréchet distance (GIS Cup). SIGSPATIAL/GIS 2017: 101:1-101:4 - [c14]Gregor Hültenschmidt, Philipp Kindermann, Wouter Meulemans, André Schulz:
Drawing Planar Graphs with Few Geometric Primitives. WG 2017: 316-329 - [i10]Gregor Hültenschmidt, Philipp Kindermann, Wouter Meulemans, André Schulz:
Drawing Planar Graphs with Few Geometric Primitives. CoRR abs/1703.01691 (2017) - [i9]Wouter Meulemans, Bettina Speckmann, Kevin Verbeek, Jules Wulms:
A Framework for Algorithm Stability. CoRR abs/1704.08000 (2017) - [i8]Philipp Kindermann, Wouter Meulemans, André Schulz:
Experimental analysis of the accessibility of drawings with few segments. CoRR abs/1708.09815 (2017) - [i7]Arthur van Goethem, Irina Kostitsyna, Marc J. van Kreveld, Wouter Meulemans, Max Sondag, Jules Wulms:
The Painter's Problem: covering a grid with colored connected polygons. CoRR abs/1709.00001 (2017) - 2016
- [j4]Kevin Buchin, Maike Buchin, Rolf van Leusden, Wouter Meulemans, Wolfgang Mulzer:
Computing the Fréchet Distance with a Retractable Leash. Discret. Comput. Geom. 56(2): 315-336 (2016) - [j3]Kevin Buchin, Wouter Meulemans, André van Renssen, Bettina Speckmann:
Area-Preserving Simplification and Schematization of Polygonal Subdivisions. ACM Trans. Spatial Algorithms Syst. 2(1): 2:1-2:36 (2016) - [c13]Quirijn W. Bouts, Irina Kostitsyna, Marc J. van Kreveld, Wouter Meulemans, Willem Sonke, Kevin Verbeek:
Mapping Polygons to the Grid with Small Hausdorff and Fréchet Distance. ESA 2016: 22:1-22:16 - [c12]Jan-Henrik Haunert, Wouter Meulemans:
Partitioning Polygons via Graph Augmentation. GIScience 2016: 18-33 - [i6]Wouter Meulemans:
Discretized Approaches to Schematization. CoRR abs/1606.06488 (2016) - [i5]Quirijn W. Bouts, Irina Kostitsyna, Marc J. van Kreveld, Wouter Meulemans, Willem Sonke, Kevin Verbeek:
Mapping polygons to the grid with small Hausdorff and Fréchet distance. CoRR abs/1606.06660 (2016) - 2015
- [j2]Arthur van Goethem, Wouter Meulemans, Bettina Speckmann, Jo Wood:
Exploring Curved Schematization of Territorial Outlines. IEEE Trans. Vis. Comput. Graph. 21(8): 889-902 (2015) - [c11]Alexander Igamberdiev, Wouter Meulemans, André Schulz:
Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms and Experiments. GD 2015: 113-124 - [c10]Wouter Meulemans, André Schulz:
A Tale of Two Communities: Assessing Homophily in Node-Link Diagrams. GD 2015: 489-501 - 2014
- [c9]Arthur van Goethem, Wouter Meulemans, Bettina Speckmann, Jo Wood:
Exploring Curved Schematization. PacificVis 2014: 1-8 - [c8]Thomas C. van Dijk, Arthur van Goethem, Jan-Henrik Haunert, Wouter Meulemans, Bettina Speckmann:
Map Schematization with Circular Arcs. GIScience 2014: 1-17 - [c7]Kevin Buchin, Maike Buchin, Wouter Meulemans, Wolfgang Mulzer:
Four Soviets Walk the Dog - with an Application to Alt's Conjecture. SODA 2014: 1399-1413 - 2013
- [j1]Wouter Meulemans, Nathalie Henry Riche, Bettina Speckmann, Basak Alper, Tim Dwyer:
KelpFusion: A Hybrid Set Visualization Technique. IEEE Trans. Vis. Comput. Graph. 19(11): 1846-1858 (2013) - [c6]Kevin Buchin, Maike Buchin, Rolf van Leusden, Wouter Meulemans, Wolfgang Mulzer:
Computing the Fréchet Distance with a Retractable Leash. ESA 2013: 241-252 - [c5]Thomas C. van Dijk, Arthur van Goethem, Jan-Henrik Haunert, Wouter Meulemans, Bettina Speckmann:
Accentuating focus maps via partial schematization. SIGSPATIAL/GIS 2013: 418-421 - [i4]Wouter Meulemans:
Map Matching with Simplicity Constraints. CoRR abs/1306.2827 (2013) - [i3]Kevin Buchin, Maike Buchin, Rolf van Leusden, Wouter Meulemans, Wolfgang Mulzer:
Computing the Fréchet Distance with a Retractable Leash. CoRR abs/1306.5527 (2013) - 2012
- [c4]Kevin Buchin, Maike Buchin, Wouter Meulemans, Bettina Speckmann:
Locally Correct Fréchet Matchings. ESA 2012: 229-240 - [i2]Kevin Buchin, Maike Buchin, Wouter Meulemans, Bettina Speckmann:
Locally Correct Frechet Matchings. CoRR abs/1206.6257 (2012) - [i1]Kevin Buchin, Maike Buchin, Wouter Meulemans, Wolfgang Mulzer:
Four Soviets Walk the Dog - with an Application to Alt's Conjecture. CoRR abs/1209.4403 (2012) - 2011
- [c3]Kevin Buchin, Wouter Meulemans, Bettina Speckmann:
A new method for subdivision simplification with applications to urban-area generalization. GIS 2011: 261-270 - [c2]Mark de Berg, Wouter Meulemans, Bettina Speckmann:
Delineating imprecise regions via shortest-path graphs. GIS 2011: 271-280 - 2010
- [c1]Wouter Meulemans, André van Renssen, Bettina Speckmann:
Area-Preserving Subdivision Schematization. GIScience 2010: 160-174
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
