Published in: LIPIcs, Volume 277, 12th International Conference on Geographic Information Science (GIScience 2023)
Nathan van Beusekom, Wouter Meulemans, Bettina Speckmann, and Jo Wood. Data-Spatial Layouts for Grid Maps. In 12th International Conference on Geographic Information Science (GIScience 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 277, pp. 10:1-10:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{vanbeusekom_et_al:LIPIcs.GIScience.2023.10, author = {van Beusekom, Nathan and Meulemans, Wouter and Speckmann, Bettina and Wood, Jo}, title = {{Data-Spatial Layouts for Grid Maps}}, booktitle = {12th International Conference on Geographic Information Science (GIScience 2023)}, pages = {10:1--10:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-288-4}, ISSN = {1868-8969}, year = {2023}, volume = {277}, editor = {Beecham, Roger and Long, Jed A. and Smith, Dianna and Zhao, Qunshan and Wise, Sarah}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.GIScience.2023.10}, URN = {urn:nbn:de:0030-drops-189052}, doi = {10.4230/LIPIcs.GIScience.2023.10}, annote = {Keywords: Grid map, algorithms, trade-offs} }
Published in: LIPIcs, Volume 208, 11th International Conference on Geographic Information Science (GIScience 2021) - Part II
Bram Custers, Wouter Meulemans, Bettina Speckmann, and Kevin Verbeek. Coordinated Schematization for Visualizing Mobility Patterns on Networks. In 11th International Conference on Geographic Information Science (GIScience 2021) - Part II. Leibniz International Proceedings in Informatics (LIPIcs), Volume 208, pp. 7:1-7:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{custers_et_al:LIPIcs.GIScience.2021.II.7, author = {Custers, Bram and Meulemans, Wouter and Speckmann, Bettina and Verbeek, Kevin}, title = {{Coordinated Schematization for Visualizing Mobility Patterns on Networks}}, booktitle = {11th International Conference on Geographic Information Science (GIScience 2021) - Part II}, pages = {7:1--7:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-208-2}, ISSN = {1868-8969}, year = {2021}, volume = {208}, editor = {Janowicz, Krzysztof and Verstegen, Judith A.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.GIScience.2021.II.7}, URN = {urn:nbn:de:0030-drops-147665}, doi = {10.4230/LIPIcs.GIScience.2021.II.7}, annote = {Keywords: Trajectories, Visualization, Schematization} }
Published in: LIPIcs, Volume 202, 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)
Pantea Haghighatkhah, Wouter Meulemans, Bettina Speckmann, Jérôme Urhausen, and Kevin Verbeek. Obstructing Classification via Projection. In 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 202, pp. 56:1-56:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{haghighatkhah_et_al:LIPIcs.MFCS.2021.56, author = {Haghighatkhah, Pantea and Meulemans, Wouter and Speckmann, Bettina and Urhausen, J\'{e}r\^{o}me and Verbeek, Kevin}, title = {{Obstructing Classification via Projection}}, booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)}, pages = {56:1--56:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-201-3}, ISSN = {1868-8969}, year = {2021}, volume = {202}, editor = {Bonchi, Filippo and Puglisi, Simon J.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.56}, URN = {urn:nbn:de:0030-drops-144965}, doi = {10.4230/LIPIcs.MFCS.2021.56}, annote = {Keywords: Projection, classification, models of learning} }
Published in: LIPIcs, Volume 189, 37th International Symposium on Computational Geometry (SoCG 2021)
Tim Ophelders, Ignaz Rutter, Bettina Speckmann, and Kevin Verbeek. Polygon-Universal Graphs. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 55:1-55:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{ophelders_et_al:LIPIcs.SoCG.2021.55, author = {Ophelders, Tim and Rutter, Ignaz and Speckmann, Bettina and Verbeek, Kevin}, title = {{Polygon-Universal Graphs}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {55:1--55:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.55}, URN = {urn:nbn:de:0030-drops-138540}, doi = {10.4230/LIPIcs.SoCG.2021.55}, annote = {Keywords: Graph drawing, partial drawing extension, simple polygon} }
Published in: LIPIcs, Volume 177, 11th International Conference on Geographic Information Science (GIScience 2021) - Part I (2020)
Marc van Kreveld, Tim Ophelders, Willem Sonke, Bettina Speckmann, and Kevin Verbeek. Volume from Outlines on Terrains. In 11th International Conference on Geographic Information Science (GIScience 2021) - Part I. Leibniz International Proceedings in Informatics (LIPIcs), Volume 177, pp. 16:1-16:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{vankreveld_et_al:LIPIcs.GIScience.2021.I.16, author = {van Kreveld, Marc and Ophelders, Tim and Sonke, Willem and Speckmann, Bettina and Verbeek, Kevin}, title = {{Volume from Outlines on Terrains}}, booktitle = {11th International Conference on Geographic Information Science (GIScience 2021) - Part I}, pages = {16:1--16:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-166-5}, ISSN = {1868-8969}, year = {2020}, volume = {177}, editor = {Janowicz, Krzysztof and Verstegen, Judith A.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.GIScience.2021.I.16}, URN = {urn:nbn:de:0030-drops-130512}, doi = {10.4230/LIPIcs.GIScience.2021.I.16}, annote = {Keywords: Terrain model, similarity, volume, computation} }
Published in: LIPIcs, Volume 99, 34th International Symposium on Computational Geometry (SoCG 2018)
Arthur van Goethem and Kevin Verbeek. Optimal Morphs of Planar Orthogonal Drawings. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 42:1-42:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{vangoethem_et_al:LIPIcs.SoCG.2018.42, author = {van Goethem, Arthur and Verbeek, Kevin}, title = {{Optimal Morphs of Planar Orthogonal Drawings}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {42:1--42:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.42}, URN = {urn:nbn:de:0030-drops-87550}, doi = {10.4230/LIPIcs.SoCG.2018.42}, annote = {Keywords: Homotopy, Morphing, Orthogonal drawing, Spirality} }
Published in: LIPIcs, Volume 92, 28th International Symposium on Algorithms and Computation (ISAAC 2017)
Irina Kostitsyna, Bettina Speckmann, and Kevin Verbeek. Non-Crossing Geometric Steiner Arborescences. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 54:1-54:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{kostitsyna_et_al:LIPIcs.ISAAC.2017.54, author = {Kostitsyna, Irina and Speckmann, Bettina and Verbeek, Kevin}, title = {{Non-Crossing Geometric Steiner Arborescences}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {54:1--54:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.54}, URN = {urn:nbn:de:0030-drops-82342}, doi = {10.4230/LIPIcs.ISAAC.2017.54}, annote = {Keywords: Steiner arborescences, non-crossing drawing, rectilinear, angle-restricted} }
Published in: LIPIcs, Volume 77, 33rd International Symposium on Computational Geometry (SoCG 2017)
Maarten Kleinhans, Marc van Kreveld, Tim Ophelders, Willem Sonke, Bettina Speckmann, and Kevin Verbeek. Computing Representative Networks for Braided Rivers. In 33rd International Symposium on Computational Geometry (SoCG 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 77, pp. 48:1-48:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{kleinhans_et_al:LIPIcs.SoCG.2017.48, author = {Kleinhans, Maarten and van Kreveld, Marc and Ophelders, Tim and Sonke, Willem and Speckmann, Bettina and Verbeek, Kevin}, title = {{Computing Representative Networks for Braided Rivers}}, booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)}, pages = {48:1--48:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-038-5}, ISSN = {1868-8969}, year = {2017}, volume = {77}, editor = {Aronov, Boris and Katz, Matthew J.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.48}, URN = {urn:nbn:de:0030-drops-72204}, doi = {10.4230/LIPIcs.SoCG.2017.48}, annote = {Keywords: braided rivers, Morse-Smale complex, persistence, network extraction, polyhedral terrain} }
Published in: LIPIcs, Volume 65, 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016)
Nirman Kumar, Benjamin Raichel, Subhash Suri, and Kevin Verbeek. Most Likely Voronoi Diagrams in Higher Dimensions. In 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 65, pp. 31:1-31:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{kumar_et_al:LIPIcs.FSTTCS.2016.31, author = {Kumar, Nirman and Raichel, Benjamin and Suri, Subhash and Verbeek, Kevin}, title = {{Most Likely Voronoi Diagrams in Higher Dimensions}}, booktitle = {36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016)}, pages = {31:1--31:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-027-9}, ISSN = {1868-8969}, year = {2016}, volume = {65}, editor = {Lal, Akash and Akshay, S. and Saurabh, Saket and Sen, Sandeep}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2016.31}, URN = {urn:nbn:de:0030-drops-68667}, doi = {10.4230/LIPIcs.FSTTCS.2016.31}, annote = {Keywords: Uncertainty, Lower bounds, Voronoi Diagrams, Stochastic} }
Published in: LIPIcs, Volume 57, 24th Annual European Symposium on Algorithms (ESA 2016)
Quirijn W. Bouts, Irina Irina Kostitsyna, Marc van Kreveld, Wouter Meulemans, Willem Sonke, and Kevin Verbeek. Mapping Polygons to the Grid with Small Hausdorff and Fréchet Distance. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 22:1-22:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{bouts_et_al:LIPIcs.ESA.2016.22, author = {Bouts, Quirijn W. and Irina Kostitsyna, Irina and van Kreveld, Marc and Meulemans, Wouter and Sonke, Willem and Verbeek, Kevin}, title = {{Mapping Polygons to the Grid with Small Hausdorff and Fr\'{e}chet Distance}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {22:1--22:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.22}, URN = {urn:nbn:de:0030-drops-63738}, doi = {10.4230/LIPIcs.ESA.2016.22}, annote = {Keywords: grid mapping, Hausdorff distance, Fr\'{e}chet distance, digital geometry} }
Published in: LIPIcs, Volume 34, 31st International Symposium on Computational Geometry (SoCG 2015)
Frank Hoffmann, Klaus Kriegel, Subhash Suri, Kevin Verbeek, and Max Willert. Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Art Galleries. In 31st International Symposium on Computational Geometry (SoCG 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 34, pp. 421-435, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{hoffmann_et_al:LIPIcs.SOCG.2015.421, author = {Hoffmann, Frank and Kriegel, Klaus and Suri, Subhash and Verbeek, Kevin and Willert, Max}, title = {{Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Art Galleries}}, booktitle = {31st International Symposium on Computational Geometry (SoCG 2015)}, pages = {421--435}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-83-5}, ISSN = {1868-8969}, year = {2015}, volume = {34}, editor = {Arge, Lars and Pach, J\'{a}nos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.421}, URN = {urn:nbn:de:0030-drops-50970}, doi = {10.4230/LIPIcs.SOCG.2015.421}, annote = {Keywords: Orthogonal polygons, art gallery problem, hypergraph coloring} }
Feedback for Dagstuhl Publishing