• 170
    Citations - based on content available in repository [source: Scopus]
20152024

Content available in repository

Filter
Conference contribution

Search results

  • 2023

    A Subquadratic nε-approximation for the Continuous Fréchet Distance.

    Horst, T. V. D., Kreveld, M. J. V., Ophelders, T. & Speckmann, B., 2023, Proc. 34th Annual Symposium on Discrete Algorithms (SODA). p. 1759-1776 18 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

  • Morphing Planar Graph Drawings Through 3D

    Buchin, K., Evans, W. S., Frati, F., Kostitsyna, I., Löffler, M., Ophelders, T. & Wolff, A., 2023, SOFSEM 2023: Theory and Practice of Computer Science - 48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023, Proceedings. Gasieniec, L. (ed.). Springer, p. 80-95 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13878 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Open Access
    2 Citations (Scopus)
  • 2022

    Minimum Height Drawings of Ordered Trees in Polynomial Time: Homotopy Height of Tree Duals.

    Ophelders, T. & Parsa, S., 1 Jun 2022, 38th International Symposium on Computational Geometry, SoCG 2022. Goaoc, X. & Kerber, M. (eds.). p. 55:1-55:16 55. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 224).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

  • 2021

    A family of metrics from the truncated smoothing of reeb graphs

    Chambers, E. W., Munch, E. & Ophelders, T., 1 Jun 2021, 37th International Symposium on Computational Geometry, SoCG 2021. Buchin, K. & de Verdiere, E. C. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 22. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 189).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    3 Citations (Scopus)
  • Computing the Fréchet Distance Between Uncertain Curves in One Dimension

    Buchin, K., Löffler, M., Ophelders, T., Popov, A., Urhausen, J. & Verbeek, K., 11 Aug 2021, Algorithms and Data Structures: 17th International Symposium, WADS 2021, Virtual Event, August 9–11, 2021, Proceedings. Lubiw, A. & Salavatipour, M. (eds.). Cham, Switzerland: Springer Nature, p. 243–257 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12808 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

  • Polygon-universal graphs

    Ophelders, T., Rutter, I., Speckmann, B. & Verbeek, K., 1 Jun 2021, 37th International Symposium on Computational Geometry, SoCG 2021. Buchin, K. & de Verdiere, E. C. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 55. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 189).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    4 Citations (Scopus)
  • 2020

    Between shapes, using the Hausdorff distance

    van Kreveld, M., Miltzow, T., Ophelders, T., Sonke, W. & Vermeulen, J. L., Dec 2020, 31st International Symposium on Algorithms and Computation, ISAAC 2020. Cao, Y., Cheng, S-W. & Li, M. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 13:1-13:16 16 p. 13. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 181).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Open Access
  • Planar Emulators for Monge Matrices

    Chang, H-C. & Ophelders, T. A. E., 2020, Proc. 32nd Canadian Conference on Computational Geometry (CCCG). p. 141-147 7 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    1 Citation (Scopus)
  • Route-preserving Road Network Generalization

    Van De Kerkhof, M., Kostitsyna, I., Van Kreveld, M., Löffler, M. & Ophelders, T., 3 Nov 2020, Proceedings of the 28th International Conference on Advances in Geographic Information Systems, SIGSPATIAL GIS 2020. Lu, C-T., Wang, F., Trajcevski, G., Huang, Y., Newsam, S. & Xiong, L. (eds.). Association for Computing Machinery, Inc, p. 381-384 4 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    2 Citations (Scopus)
  • Volume from Outlines on Terrains

    Van Kreveld, M., Ophelders, T., Sonke, W., Speckmann, B. & Verbeek, K., 1 Sept 2020, 11th International Conference on Geographic Information Science, GIScience 2021. Janowicz, K. & Verstegen, J. A. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 16:1-16:15 15 p. 16. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 177).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Open Access
  • 2019

    Convex polygons in Cartesian products

    De Carufel, J. L., Dumitrescu, A., Meulemans, W., Ophelders, T., Pennarun, C., Tóth, C. D. & Verdonschot, S., 1 Jun 2019, 35th International Symposium on Computational Geometry, SoCG 2019. Barequet, G. & Wang, Y. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 17 p. 22. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 129).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Open Access
    File
    139 Downloads (Pure)
  • Homotopy Height, Grid-Major Height and Graph-Drawing Height

    Biedl, T. C., Chambers, E. W., Eppstein, D., Mesmay, A. D. & Ophelders, T., 2019, Graph Drawing and Network Visualization - 27th International Symposium, GD 2019, Proceedings. Archambault, D. & Tóth, C. D. (eds.). p. 468-481 14 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    1 Citation (Scopus)
  • SETH says: weak Fréchet distance is faster, but only if it is continuous and in one dimension

    Buchin, K., Ophelders, T. & Speckmann, B., 1 Jan 2019, Proc. 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). New York: Association for Computing Machinery, Inc, p. 2887-2899 13 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    23 Citations (Scopus)
    1 Downloads (Pure)
  • Topological Mapper for 3D Volumetric Images.

    Chitwood, D. H., Eithun, M., Munch, E. & Ophelders, T., 2019, Mathematical Morphology and Its Applications to Signal and Image Processing - 14th International Symposium, ISMM 2019, Proceedings. Burgeth, B., Kleefeld, A., Naegel, B., Passat, N. & Perret, B. (eds.). p. 84-95 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11564 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    3 Citations (Scopus)
  • 2018

    On the complexity of optimal homotopies

    Chambers, E. W., de Mesmay, A. & Ophelders, T. A. E., 7 Jan 2018, 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018. Czumaj, A. (ed.). New York: Association for Computing Machinery, Inc, p. 1121-1134 14 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Open Access
    File
    4 Citations (Scopus)
    214 Downloads (Pure)
  • Volume-based similarity of linear features on terrains

    Sonke, W., van Kreveld, M., Ophelders, T., Speckmann, B. & Verbeek, K., 6 Nov 2018, 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2018. Xiong, L., Tamassia, R., Banaei, K. F., Guting, R. H. & Hoel, E. (eds.). New York: Association for Computing Machinery, Inc, p. 444-447 4 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Open Access
    File
    1 Citation (Scopus)
    120 Downloads (Pure)
  • 2017

    Computing optimal homotopies over a spiked plane with polygonal boundary

    Burton, B., Chambers, E. W., Van Kreveld, M. J., Meulemans, W., Ophelders, T. A. E. & Speckmann, B., 1 Sept 2017, Proc. 25th European Symposium on Algorithms (ESA). Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 1-14 23. (LIPICS; vol. 87).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Open Access
    File
    3 Citations (Scopus)
    127 Downloads (Pure)
  • Computing representative networks for braided rivers

    Kleinhans, M., van Kreveld, M. J., Ophelders, T. A. E., Sonke, W. M., Speckmann, B. & Verbeek, K. A. B., 1 Jun 2017, 33rd International Symposium on Computational Geometry, SoCG 2017. Katz, M. J. & Aronov, B. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 1-16 16 p. 48

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Open Access
    File
    3 Citations (Scopus)
    376 Downloads (Pure)
  • Computing the Fréchet distance between real-valued surfaces

    Buchin, K., Ophelders, T. & Speckmann, B., 2017, Proc. 28th Annual Symposium on Discrete Algorithms (SODA). Klein, P. N. (ed.). Philadelphia: Association for Computing Machinery, Inc, p. 2443-2455 13 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Open Access
    File
    3 Citations (Scopus)
    208 Downloads (Pure)
  • Data structures for Fréchet queries in trajectory data

    de Berg, M. T., Mehrabi, A. D. & Ophelders, T. A. E., 2017, CCCG 2017 - 29th Canadian Conference on Computational Geometry, Proceedings 2017. p. 214-219 6 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    File
    9 Citations (Scopus)
    223 Downloads (Pure)
  • 2016

    The complexity of snake

    De Biasi, M. & Ophelders, T., 1 Jun 2016, Proc. 8th International Conference on Fun with Algorithms (FUN). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 1-13 13 p. 11. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 49).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Open Access
    File
    2 Citations (Scopus)
    413 Downloads (Pure)
  • 2015

    Computing the similarity between moving curves

    Buchin, K., Ophelders, T. A. E. & Speckmann, B., 2015, Proc. 23rd Annual European Symposium on Algorithms (ESA). Bansal, N. & Finocchi, I. (eds.). Springer, p. 928-940 (Lecture Notes in Computer Science; vol. 9294).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Open Access
    File
    3 Citations (Scopus)
    197 Downloads (Pure)