Content available in repository
Content available in repository
Network
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
-
Computing the Fréchet Distance Between Uncertain Curves in One Dimension
Buchin, K., Löffler, M., Ophelders, T., Popov, A., Urhausen, J. & Verbeek, K., 1 Feb 2023, In: Computational Geometry: Theory and Applications. 109, 21 p., 101923.Research output: Contribution to journal › Article › Academic › peer-review
Open AccessFile4 Downloads (Pure) -
Segment Visibility Counting Queries in Polygons
Buchin, K., Custers, B., van der Hoog, I., Löffler, M., Popov, A., Roeloffzen, M. & Staals, F., 14 Dec 2022, 33rd International Symposium on Algorithms and Computation, ISAAC 2022: ISAAC 2022. Bae, S. W. & Park, H. (eds.). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 16 p. 58. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 248).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review
Open Access -
Segment Visibility Counting Queries in Polygons
Buchin, K., Custers, B., van der Hoog, I., Löffler, M., Popov, A., Roeloffzen, M. & Staals, F., 24 Mar 2022, p. 46:1–46:8. 8 p.Research output: Contribution to conference › Abstract › Academic
Open Access -
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 proceeding › Conference contribution › Academic › peer-review
-
Uncertain Curve Simplification
Buchin, K., Löffler, M., Popov, A. & Roeloffzen, M., 18 Aug 2021, 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021: MFCS 2021. Bonchi, F. & Puglisi, S. J. (eds.). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 22 p. 26. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 202).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review
Open Access
Thesis
-
Similarity of Uncertain Trajectories
Author: Popov, A., 25 Nov 2019Supervisor: Buchin, K. (Supervisor 1), Roeloffzen, M. (Supervisor 2) & Löffler, M. (External person) (External coach)
Student thesis: Master
File