Publications
2023
Scholarly publications
Buchin, K., Löffler, M., Ophelders, T., Popov, A., Urhausen, J., & Verbeek, K. (2023). Computing the Fréchet distance between uncertain curves in one dimension. Computational Geometry: Theory and Applications, 109, 1-21. [101923]. https://doi.org/10.1016/j.comgeo.2022.101923
2022
Scholarly publications
Buchin, K., Evans, W. S., Frati, F., Kostitsyna, I., Löffler, M., Ophelders, T., & Wolff, A. (2022). Morphing Planar Graph Drawings Through 3D. In L. Gąsieniec (Ed.), SOFSEM 2023: Theory and Practice of Computer Science: 48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023, Nový Smokovec, Slovakia, January 15–18, 2023, Proceedings (1 ed., pp. 80-95). Springer Cham. https://doi.org/10.1007/978-3-031-23101-8_6
Dell'Anna, D., Alechina, N., Dalpiaz, F., Dastani, M., Löffler, M., & Logan, B. (2022). The Complexity of Norm Synthesis and Revision. In N. Ajmeri, A. M. Martin, & B. T. R. Savarimuthu (Eds.), Coordination, Organizations, Institutions, Norms, and Ethics for Governance of Multi-Agent Systems XV: International Workshop, COINE 2022, Virtual Event, May 9, 2022, Revised Selected Papers (pp. 38-53). (Lecture Notes in Computer Science ; Vol. 13549). Springer. https://doi.org/10.1007/978-3-031-20845-4_3
van der Horst, T., Löffler, M., & Staals, F. (2022). Chromatic $k$-Nearest Neighbor Queries. In S. Chechik, G. Navarro, E. Rotenberg, & G. Herman (Eds.), 30th Annual European Symposium on Algorithms (ESA 2022) (pp. 67:1-67:14). (Leibniz International Proceedings in Informatics (LIPIcs); Vol. 244). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.ESA.2022.67
2021
Scholarly publications
van de Kerkhof, M., Kostitsyna, I., & Löffler, M. (2021). Embedding Ray Intersection Graphs and Global Curve Simplification. In H. C. Purchase, & I. Rutter (Eds.), Graph Drawing and Network Visualization: 29th International Symposium, GD 2021, Tübingen, Germany, September 14–17, 2021, Revised Selected Papers (1 ed., pp. 358–371). (Lecture Notes in Computer Science; Vol. 12868). Springer Cham. https://doi.org/10.1007/978-3-030-92931-2_26
Acharyya, A., Jallu, R., Löffler, M., Meijer, G., Saumell, M., I. Silveira, R., Staals, F., & Raj Tiwary, H. (2021). Terrain Prickliness: Theoretical Grounds for High Complexity Viewsheds. In K. Janowicz, & J. A. Verstegen (Eds.), 11th International Conference on Geographic Information Science (GIScience 2021) (Vol. 2, pp. 10:1-10:16). (Leibniz International Proceedings in Informatics (LIPIcs); Vol. 208). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.GIScience.2021.II.10
van der Hoog, I., van de Kerkhof, M., van Kreveld, M., Löffler, M., Staals, F., Urhausen, J., & Vermeulen, J. (2021). Mapping Multiple Regions to the Grid with Bounded Hausdorff Distance. In A. Lubiw, M. Salavatipour, & M. He (Eds.), Algorithms and Data Structures: 17th International Symposium, WADS 2021, Virtual Event, August 9–11, 2021, Proceedings (1 ed., pp. 627-640). (Lecture Notes in Computer Science; Vol. 12808). Springer Cham. https://doi.org/10.1007/978-3-030-83508-8_45
2020
Scholarly publications
Eades, P., van der Hoog, I. D., Löffler, M., & Staals, F. (2020). Trajectory Visibility. In 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020) (Leibniz International Proceedings in Informatics (LIPIcs); Vol. 162). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.SWAT.2020.23
van de Kerkhof, M. A., Kostitsyna, I., van Kreveld, M. J., Löffler, M., & Ophelders, T. (2020). Route-Preserving Road Network Generalization. 381-384. Poster session presented at 28th International Conference on Advances in Geographic Information Systems, Seattle, United States. https://doi.org/10.1145/3397536.3422234
2019
Scholarly publications
Wiratma, L., van Kreveld, M. J., Löffler, M., & Staals, F. (2019). An Experimental Evaluation of Grouping Definitions for Moving Entities. In SIGSPATIAL '19: Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems - November 2019 (pp. 89-9T). ACM. https://doi.org/10.1145/3347146.3359346
Kostitsyna, I., Löffler, M., Polishchuk, V., & Staals, F. (2019). Most vital segment barriers. In Z. Friggstad, J-R. Sack, & M. R. Salavatipour (Eds.), Algorithms and Data Structures: 16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019, Proceedings (1 ed., pp. 495-509). (Lecture Notes in Computer Science ; Vol. 11646). Springer Cham. https://doi.org/10.1007/978-3-030-24766-9_36
van de Kerkhof, M. A., Kostitsyna, I., Löffler, M., Mirzanezhad, M., & Wenk, C. (2019). Global Curve Simplification. 67:1-67-14. Paper presented at 27th Annual European Symposium on Algorithms, München, Bavaria, Germany. https://doi.org/10.4230/LIPIcs.ESA.2019.67
van der Hoog, I., Kostitsyna, I., Löffler, M., & Speckmann, B. (2019). Preprocessing Ambiguous Imprecise Points. In G. Barequet, & Y. Wang (Eds.), 35th International Symposium on Computational Geometry (SoCG 2019) (Vol. 129). [42] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2019.42
van de Kerkhof, M., de Jong, T., Parment, R., Löffler, M., Vaxman, A., & van Kreveld, M. (2019). Design and Automated Generation of Japanese Picture Puzzles. Computer Graphics Forum, 38(2), 343-353. https://doi.org/10.1111/cgf.13642
Buchin, K., Kostitsyna, I., Löffler, M., & Silveira, R. I. (2019). Region-based approximation of probability distributions (for visibility between imprecise points among obstacles). Algorithmica, 81, 2682–2715. https://doi.org/10.1007/s00453-019-00551-2
Buchin, K., Driemel, A., Gudmundsson, J., Horton, M., Kostitsyna, I., Löffler, M., & Silveira, R. I. (2019). Approximating (k, l) -center clustering for curves. In Proc. 29th Symposium on Discrete Algorithms
2018
Scholarly publications
van der Hoog, I., Khramtcova, E., & Löffler, M. (2018). Dynamic smooth compressed quadtrees. In 34th International Symposium on Computational Geometry (SoCG 2018)
van Kreveld, M., Löffler, M., Staals, F., & Wiratma, L. (2018). A Refined Definition for Groups of Moving Entities and its Computation. International Journal of Computational Geometry and Applications, 28(2), 181-196. https://doi.org/10.1142/S0218195918600051
van de Kerkhof, M., Kostitsyna, I., Löffler, M., Mirzanezhad, M., & Wenk, C. (2018). On Optimal Min- Curve Simplification Problem. In Proc. 28th Fall Workshop on Computational Geometry
van Kreveld, M., Löffler, M., & Wiratma, L. (2018). On Optimal Polyline Simplification using the Hausdorff and Fréchet Distance. In B. Speckmann, & C. D. Toth (Eds.), 34th International Symposium on Computational Geometry (SoCG 2018) (pp. 56:1-56:14). (Leibniz International Proceedings in Informatics (LIPIcs); Vol. 99). Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH. https://doi.org/10.4230/LIPIcs.SoCG.2018.56
Keikha, V., van de Kerkhof, M., Kostitsyna, I., van Kreveld, M., Löffler, M., Staals, F., Urhausen, J., Vermeulen, J., & Wiratma, L. (2018). Convex Partial Transversals of Planar Regions.
v.d., I. H., Khramtcova, E., & Löffler, M. (Accepted/In press). Dynamic smooth compressed quadtrees. In 3rd Highlights of Algorithms (HALG 2018) Vrije Universiteit Amsterdam.
v.d., I. H., Khramtcova, E., & Löffler, M. (2018). Dynamic smooth compressed quadtrees. In B. Speckmann, & C. D. Tóth (Eds.), 34th International Symposium on Computational Geometry: SoCG 2018, June 11–14, 2018, Budapest, Hungary [45] (Leibniz International Proceedings in Informatics; Vol. 99). Leibniz International Proceedings in Informatics (LIPIcs). https://doi.org/10.4230/LIPIcs.SoCG.2018.45
Kostitsyna, I., Löffler, M., Sondag, M., Sonke, W., & Wulms, J. (2018). The hardness of Witness puzzles. In Proc. 34th European Workshop on Computational Geometry: EuroCG 18 [67] Freie Universität Berlin.
Korman, M., Löffler, M., Silveira, R. I., & Strash, D. (2018). On the Complexity of Barrier Resilience for Fat Regions and Bounded Ply. Computational Geometry: Theory and Applications, 72, 34-51. https://doi.org/10.1016/j.comgeo.2018.02.006
Duncan, C., Eppstein, D., Goodrich, M. T., Kobourov, S., Löffler, M., & Nöllenburg, M. (2018). Planar and Poly-Arc Lombardi Drawings. Journal of Computational Geometry, 9(1), 328-355. https://doi.org/10.20382/jocg.v9i1a11
Akitaya, H., Löffler, M., & Parada, I. (2018). How to Fit a Tree in a Box. In Proc. 26th Symposium on Graph Drawing
Wiratma, L., Löffler, M., & Staals, F. (2018). An experimental comparison of two definitions for groups of moving entities. In S. Winter, A. Griffin, & M. Sester (Eds.), Proc. 10th International Conference on Geographic Information Science : GIScience 2018 [64] (Leibniz International Proceedings in Informatics; Vol. 114). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.GISCIENCE.2018.64
Kerkhof, M. V. D., Kreveld, M. V., Kostitsyna, I., & Löffler, M. (2018). The Start-Stop Diagram as a Tool for Continuous Trajectory Simplification. In GIScience Workshop on Analysis of Movement Data
Buchin, K., Driemel, A., Gudmundsson, J., Horton, M., Kostitsyna, I., Löffler, M., & Silveira, R. I. (2018). Approximating (k,ℓ)-center clustering for curves. Manuscript submitted for publication. http://arXiv.org/abs/1805.01547
Kreveld, M. V., Löffler, M., & Wiratma, L. (2018). On Optimal Polyline Simplification using the Hausdorff and Fréchet Distance. In B. Speckmann, & C. D. Tóth (Eds.), 34th International Symposium on Computational Geometry: SoCG 2018, June 11–14, 2018, Budapest, Hungary (pp. 56:1-56:14). [56] (Leibniz International Proceedings in Informatics; Vol. 99). Leibniz International Proceedings in Informatics (LIPIcs). https://doi.org/10.4230/LIPIcs.SoCG.2018.56
Keikha, V., Löffler, M., Mohades, A., & Rahmati, Z. (2018). Width and Bounding Box of Imprecise Points. In Proc. 30th Canadian Conference on Computational Geometry
Keikha, V., & Löffler, M. (2018). A Fully Polynomial Time Approximation Scheme For the Smallest Diameter of Imprecise Points. In Proc. 34th European Workshop on Computational Geometry
Keikha, V., Kerkhof, M. V. D., Kostitsyna, I., Kreveld, M. V., Löffler, M., Staals, F., Urhausen, J., Vermeulen, J., & Wiratma, L. (Accepted/In press). Convex Partial Transversals of Planar Regions. In Abstracts 7th Young Researchers Forum, Computational Geometry Week 2018
Keikha, V., Kerkhof, M. V. D., Kostitsyna, I., Kreveld, M. V., Löffler, M., Staals, F., Urhausen, J., Vermeulen, J., & Wiratma, L. (2018). Convex Partial Transversals of Planar Regions. In W-L. Hsu, D-T. Lee, & C-S. Liao (Eds.), Proc. 29th International Symposium on Algorithms and Computation: ISAAC 2018, December 16–19, 2018, Jiaoxi, Yilan, Taiwan (pp. 52:1–52:12). [52] (Leibniz International Proceedings in Informatics). Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ISAAC.2018.52
v.d., I. H., & Löffler, M. (2018). Approximate stabbing queries with sub-logarithmic local replacement. In Proc. 34th European Workshop on Computational Geometry
Gudmundsson, J., Kostitsyna, I., Löffler, M., Müller, T., Sacristán, V., & Silveira, R. I. (Accepted/In press). Theoretical analysis of beaconless geocast protocols in 1D. In Proc. Analysis of Algorithms Conference
Hurtado, F., Korman, M., van Kreveld, M. J., Löffler, M., Sacristán, V., Shioura, A., Silveira, R. I., Speckmann, B., & Tokuyama, T. (2018). Colored spanning graphs for set visualization. Computational Geometry: Theory and Applications, 68, 262-276. https://doi.org/10.1016/j.comgeo.2017.06.006
Other output
Burton, B., Hillebrand, A., Löffler, M., Schleimer, S., Thurston, D., Tillmann, S., & van Toll, W. (2018). On the Topology of Walkable Environments. 66:1-6. Paper presented at 34th European Workshop on Computational Geometry, Berlin, Germany.
2017
Scholarly publications
Banyassady, B., Hoffmann, M., Klemz, B., Löffler, M., & Miltzow, T. (2017). Obedient Plane Drawings for Disk Intersection Graphs. In F. Ellen, A. Kolokolova, & J-R. Sack (Eds.), Algorithms and Data Structures: 15th International Symposium, WADS 2017 St. John's, NL, Canada, July 31 – August 2, 2017 Proceedings (pp. 73-84). (Lecture Notes in Computer Science; Vol. 10389).. https://doi.org/10.1007/978-3-319-62127-2
Kindermann, P., Kobourov, S., Löffler, M., Nöllenburg, M., Schulz, A., Thurston, D., & Vogtenhuber, B. (2017). Lombardi drawings of knots and links. In Proceedings of the 25th Symposium on Graph Drawing
https://dspace.library.uu.nl/bitstream/handle/1874/396408/1708.09819.pdf?sequence=1
https://dspace.library.uu.nl/bitstream/handle/1874/396408/1708.09819.pdf?sequence=1
Löffler, M., & Meulemans, W. (2017). Discretized Approaches to Schematization. In Proceedings of the 29th Canadian Conference on Computational Geometry
https://dspace.library.uu.nl/bitstream/handle/1874/359996/Pages_from_CCCG2017.pdf?sequence=1
https://dspace.library.uu.nl/bitstream/handle/1874/359996/Pages_from_CCCG2017.pdf?sequence=1
Aichholzer, O., Hackl, T., Korman, M., van Kreveld, M. J., Löffler, M., Pilz, A., Speckmann, B., & Welzl, E. (2017). Packing plane spanning trees and paths in complete geometric graphs. Information Processing Letters, 124, 35-41. https://doi.org/10.1016/j.ipl.2017.04.006
van Kreveld, M. J., Löffler, M., & Staals, F. (2017). Central Trajectories. Journal of Computational Geometry, 8(1). https://doi.org/10.20382/jocg.v8i1a14
Koppel, J. V. D., Löffler, M., & Ophelders, T. (2017). Computing Wave Impact in Self-Organised Mussel Beds. In Proc. 33rd European Workshop on Computational Geometry (pp. 169-172)
Wiratma, L., Kreveld, M. V., & Löffler, M. (2017). On Measures for Groups of Trajectories. In A. Bregt, T. Sarjakoski, R. V. Lammeren, & F. Rip (Eds.), Societal Geo-innovation: Selected papers of the 20th AGILE conference on Geographic Information Science (1 ed., pp. 311-330). (Lecture Notes in Geoinformation and Cartography ). Springer Cham. https://doi.org/10.1007/978-3-319-56759-4_18
Buchin, K., Chun, J., Löffler, M., Markovic, A., Meulemans, W., Okamoto, Y., & Shiitada, T. (2017). Folding Free-Space Diagrams. In Proc. 32nd Symposium on Computational Geometry
Kostitsyna, I., Löffler, M., Polishchuk, V., & Staals, F. (2017). On the complexity of minimum-link path problems. Journal of Computational Geometry, 8(2), 80-108. https://doi.org/10.20382/jocg.v8i2a5
Löffler, M., Luo, J., & Silveira, R. (2017). Geomasking through Perturbation, or Counting Points in Circles. In Proc. 33rd European Workshop on Computational Geometry (pp. 209-212)
Keikha, V., Löffler, M., & Mohades, A. (2017). Largest and Smallest Area Triangles on Imprecise Points. In Proc. 33rd European Workshop on Computational Geometry: EuroCG 2017 (pp. 125-128)
Khramtcova, E., & Löffler, M. (2017). Dynamic stabbing queries with sub-logarithmic local updates for overlapping intervals: Proc. 12th International Computer Science Symposium in Russia. In Computer Science – Theory and Applications (Lecture Notes in Computer Science; Vol. 10304). Springer. https://doi.org/10.1007/978-3-319-58747-9_17
2016
Scholarly publications
van Duijn, I., Kostitsyna, I., van Kreveld, M., & Löffler, M. (2016). Critical Placements of a Square or Circle amidst Trajectories for Junction Detection. (pp. 1-18). arXiv. https://doi.org/10.48550/arXiv.1607.05347
https://dspace.library.uu.nl/bitstream/handle/1874/350959/1607.05347v1.pdf?sequence=1
https://dspace.library.uu.nl/bitstream/handle/1874/350959/1607.05347v1.pdf?sequence=1
van Goethem, A., van Kreveld, M., Löffler, M., Speckmann, B., & Staals, F. (2016). Grouping time-varying data for interactive exploration. (pp. 1-23). arXiv. https://doi.org/10.48550/arXiv.1603.06252
Löffler, M., Nöllenburg, M., & Staals, F. (2016). Mixed Map Labeling. Journal of Spatial Information Science, 13, 3-32. https://doi.org/10.5311/JOSIS.2016.13.264
Kreveld, M. V., Löffler, M., Staals, F., & Wiratma, L. (2016). A Refined Definition for Groups of Moving Entities and its Computation. In S-H. Hong (Ed.), Proc. 27th International Symposium on Algorithms and Computation: ISAAC 2016 (pp. 48:1-48:12). (LIPIcs; Vol. 64). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.ISAAC.2016.48
Chiu, M-K., Löffler, M., Roeloffzen, M., & Uehara, R. (2016). A Hexagon-Shaped Stable Kissing Unit Disk Tree. In Graph Drawing and Network Visualization: 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers (pp. 628-630). ( Lecture Notes in Computer Science; Vol. 9801). https://doi.org/10.1007/978-3-319-50106-2
Akatya, H., Löffler, M., & Tóth, C. (2016). Multi-Colored Spanning Graphs. In Graph Drawing and Network Visualization: 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers (pp. 81-93). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9801). https://doi.org/10.1007/978-3-319-50106-2_7
Duijn, I. V., Kostitsyna, I., Kreveld, M. V., & Löffler, M. (2016). Critical Placements of a Square or Circle amidst Trajectories for Junction Detection. In Proceedings of the 28th Canadian Conference on Computational Geometry: August 3-5, 2016 Simon Fraser University Vancouver, British Columbia Canada (pp. 208-215). (The Canadian Conference on Computational Geometry).
https://dspace.library.uu.nl/bitstream/handle/1874/351024/Critical.pdf?sequence=1
https://dspace.library.uu.nl/bitstream/handle/1874/351024/Critical.pdf?sequence=1
Goethem, A. V., Staals, F., Löffler, M., Dykes, J., & Speckmann, B. (Accepted/In press). Multi-Granular Trend Detection for Time-Series Analysis. In Proc. IEEE Information Visualization Conference
Chambers, E. W., Kostitsyna, I., Löffler, M., & Staals, F. (2016). Homotopy Measures for Representative Trajectories. In Proc. 24th European Symposium on Algorithms: ESA 2016 (pp. 27:1-27:17). (LIPIcs; Vol. 57). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.ESA.2016.27
Evans, W., Kirkpatrick, D., Löffler, M., & Staals, F. (2016). Minimizing Co-location Potential of Moving Entities. SIAM Journal on Computing, 45(5), 1870-1893. https://doi.org/10.1137/15M1031217
van Kreveld, M. J., & Löffler, M. (2016). Range searching. In M-Y. Kao (Ed.), Encyclopedia of Algorithms (2016 ed., pp. 1767-1771). Springer. https://doi.org/10.1007/978-1-4939-2864-4_510
Eppstein, D., Holten, D., Löffler, M., Nöllenburg, M., Speckmann, B., & Verbeek, K. (2016). Strict Confluent Drawing. Journal of Computational Geometry, 7(1), 22-46. http://jocg.org/v7n1p2
https://dspace.library.uu.nl/bitstream/handle/1874/331168/STRICT.pdf?sequence=1
https://dspace.library.uu.nl/bitstream/handle/1874/331168/STRICT.pdf?sequence=1
Akitaya, H., Aloupis, G., Löffler, M., & Rounds, A. (2016). Trash Compaction. In Proc. 32nd European Workshop on Computational Geometry (pp. 107-110)
Evans, W., Garderen, M. V., Löffler, M., & Polishchuk, V. (2016). Recognizing a DOG is Hard but not when it is Thin and Unit. In Proc. 8th International Conference on Fun with Algorithms (pp. 16:1-16:12). (LIPIcs; Vol. 49). https://doi.org/10.4230/LIPIcs.FUN.2016.16
Aronov, B., Driemel, A., van Kreveld, M. J., Löffler, M., & Staals, F. (2016). Segmentation of Trajectories on Nonmonotone Criteria. ACM Transactions on Algorithms, 12(2), 1-28. [26]. https://doi.org/10.1145/2660772
Kostitsyna, I., Löffler, M., Staals, F., & Polishchuk, V. (2016). On the complexity of minimum-link path problems. In 32nd International Symposium on Computational Geometry (SoCG 2016) (pp. 49:1-49:16). (Leibniz International Proceedings in Informatics (LIPIcs); Vol. 51). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2016.49
Other output
Burke, K., Demaine, E., Gregg, H., Hearn, R., Hesterberg, A., Hoffman, M., Ito, H., Kostitsyna, I., Leonard, J., Löffler, M., Schmidt, C., Uehara, R., Uno, Y., & Williams, A. (2016). Single-Player and Two-Player Buttons & Scissors Games. http://arXiv.org/abs/1607.01826
Kammer, F., Löffler, M., & Silveira, R. I. (2016). Space-Efficient Hidden Surface Removal. arXiv.org. http://arXiv.org/abs/1611.06915
https://dspace.library.uu.nl/bitstream/handle/1874/351057/space.pdf?sequence=1
https://dspace.library.uu.nl/bitstream/handle/1874/351057/space.pdf?sequence=1
2015
Scholarly publications
Bowen, C., Durocher, S., Löffler, M., Rounds, A., Schulz, A., & Tóth, C. (2015). Realization of Simply Connected Polygonal Linkages. In Abstracts 4th Young Researchers Forum, Computational Geometry Week 2015 (pp. 12-13)
Bowen, C., Durocher, S., Löffler, M., Rounds, A., Schulz, A., & Tóth, C. (2015). Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees. In Proc. 23rd International Symposium on Graph Drawing (pp. 447-459). (Lecture Notes in Computer Science; Vol. 9411). https://doi.org/10.1007/978-3-319-27261-0_37
Löffler, M., & Tóth, C. (2015). Linear-size Universal Point Sets for One-bend Drawings. In Proc. 23rd International Symposium on Graph Drawing (pp. 423-429). (Lecture Notes in Computer Science ; Vol. 9411). https://doi.org/10.1007/978-3-319-27261-0_35
Kreveld, M. V., Löffler, M., & Mutser, P. (2015). Automated Puzzle Difficulty Estimation. In 2015 IEEE Conference on Computational Intelligence and Games (CIG) (pp. 415-422). IEEE. https://doi.org/10.1109/CIG.2015.7317913
Kindermann, P., Löffler, M., Nachmanson, L., & Rutter, I. (2015). Graph Drawing Contest Report 2015. In Proc. 22nd Symposium on Graph Drawing
Ham, I. V. D., Faber, A., Venselaar, M., Kreveld, M. V., & Löffler, M. (2015). Ecological validity of virtual environments to assess human navigation ability. Frontiers in Psychology, 6(637). https://doi.org/10.3389/fpsyg.2015.00637
Burke, K., Demaine, E., Hearn, R., Hesterberg, A., Hoffman, M., Ito, H., Kostitsyna, I., Löffler, M., Schmidt, C., Uno, Y., Uehara, R., & Williams, A. (2015). Single-Player and Two-Player Buttons & Scissors Games. In Proc. 18th Japan Conference on Discrete and Computational Geometry and Graphs
Kostitsyna, I., Kreveld, M. V., Löffler, M., Speckmann, B., & Staals, F. (2015). Trajectory Grouping Structure under Geodesic Distance. In Proc. 31st International Symposium on Computational Geometry
https://dspace.library.uu.nl/bitstream/handle/1874/326601/Trajectory.pdf?sequence=1
https://dspace.library.uu.nl/bitstream/handle/1874/326601/Trajectory.pdf?sequence=1
Chambers, E. W., Kostitsyna, I., Löffler, M., & Staals, F. (2015). Homotopy Measures for Representative Trajectories. In Proc. 31st European Workshop on Computational Geometry (pp. 125-128)
Kreveld, M. V., Löffler, M., & Staals, F. (2015). Central Trajectories. In Proc. 31st European Workshop on Computational Geometry (pp. 129-132)
Dumitrescu, A., Löffler, M., Schulz, A., & Tóth, C. (2015). Counting Carambolas. Graphs and Combinatorics, 32(3), 923-942. https://doi.org/10.1007/s00373-015-1621-7
2014
Scholarly publications
Löffler, M., & Mulzer, W. (2014). Unions of Onions: Preprocessing Imprecise Points for Fast Onion Layer Decomposition. Journal of Computational Geometry, 5(1), 1-13. http://jocg.org/v5n1p1
Hurtado, F., Löffler, M., Matos, I., Sacristán, V., Saumell, M., Silveira, R. I., & Staals, F. (2014). Terrain Visibility with Multiple Viewpoints. International Journal on Computational Geometry and Applications, 24(4), 275-306. https://doi.org/10.1142/S0218195914600085
Gutwenger, C., Löffler, M., Nachmanson, L., & Rutter, I. (2014). Graph Drawing Contest Report 2014. In Proc. 21st Symposium on Graph Drawing
Ham, I. V. D., Faber, A., Venselaar, M., van Kreveld, M., & Löffler, M. (2014). Route Memory in Real, Virtual, and Hybrid Environments. In Abstracts of the Psychonomic Society (Vol. 19, pp. 67) http://www.psychonomic.org/Assets/a90b21c9-333a-43f8-83c2-96c001ba1d52/635454216658270000/2014-psychonomic-society-abstract-book-pdf
Aichholzer, O., Hackl, T., Korman, M., van Kreveld, M., Löffler, M., Pilz, A., Speckmann, B., & Welzl, E. (2014). Packing Plane Spanning Trees and Paths in Complete Geometric Graphs. In 26th Canadian Conference on Computational Geometry (CCCG) 2014 Proceedings (pp. 233-238) http://www.cccg.ca/proceedings/2014/
Ackerman, E., Allen, M., Barequet, G., Löffler, M., Mermelstein, J., Souvaine, D., & Tóth, C. (2014). The Flip Diameter of Rectangulations and Convex Subdivisions. In Proc. 11th Latin American Symposium on Theoretical Informatics
Kostitsyna, I., Löffler, M., & Polishchuk, V. (2014). Optimizing Airspace Closure with respect to Politicians' Egos. In A. Ferro, F. Luccio, & P. Widmayer (Eds.), Fun with Algorithms: 7th International Conference, FUN 2014, Lipari Island, Sicily, Italy, July 1-3, 2014. Proceedings (pp. 264-276). (Lecture Notes in Computer Science; Vol. 8496). Springer. https://doi.org/10.1007/978-3-319-07890-8_23
Other output
Dumitrescu, A., Löffler, M., Schulz, A., & Tóth, C. (2014). Counting Carambolas. http://arXiv.org/abs/1410.1579
2013
Scholarly publications
Hurtado, F., Löffler, M., Matos, I., Sacristán, V., Saumell, M., Silveira, R. I., & Staals, F. (2013). Terrain Visibility with Multiple Viewpoints. In Proc. 24th International Symposium on Algorithms and Computation (pp. 317-327). (LNCS 8283). https://doi.org/10.1007/978-3-642-45030-3_30
Korman, M., Löffler, M., Silveira, R. I., & Strash, D. (2013). On the Complexity of Barrier Resilience for Fat Regions. In Proc. 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (pp. 201-216). (LNCS 8243).
van Kreveld, M., Löffler, M., & Staals, F. (2013). Clear Unit-Distance Graphs. In EuroCG 2013: The 29th European Workshop on Computational Geometry: March 17-20, 2013, Braunschweig, Germany (pp. 213-216)
https://dspace.library.uu.nl/bitstream/handle/1874/321574/13.pdf?sequence=1
https://dspace.library.uu.nl/bitstream/handle/1874/321574/13.pdf?sequence=1
Other output
Eppstein, D., Holten, D., Löffler, M., Nöllenburg, M., Speckmann, B., & Verbeek, K. (2013). Strict Confluent Drawing. http://arXiv.org/abs/1308.6824
2012
Scholarly publications
Löffler, M., & Mulzer, W. (2012). Triangulating the Square: Quadtrees and Delaunay Triangulations are Equivalent. SIAM Journal on Computing, 41(4), 941-974. https://doi.org/10.1137/110825698
2011
Scholarly publications
Eppstein, D., Goodrich, M. T., Löffler, M., Strash, D., & Trott, L. (2011). Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon. In Proc. 3rd International Conference on Computational Aspects of Social Networks (pp. 102-107)
Eppstein, D., Goodrich, M. T., Löffler, M., Strash, D., & Trott, L. (2011). Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon. In Graph Algorithms and Applications
Eppstein, D., & Löffler, M. (2011). Bounds on the Complexity of Halfspace Intersections when the Bounded Faces have Small Dimension. In Proc. 27th Symposium on Computational Geometry (pp. 361-369) https://doi.org/10.1145/1998196.1998257
Löffler, M., & Mulzer, W. (2011). Triangulating the Square: Quadtrees and Delaunay Triangulations are Equivalent. In Proc. 22nd Symposium on Discrete Algorithms (pp. 1759-1777) http://www.siam.org/proceedings/soda/2011/SODA11_134_loefflerm.pdf
Duncan, C., Eppstein, D., Goodrich, M. T., Kobourov, S., & Löffler, M. (2011). Planar and Poly-Arc Lombardi Drawings. In Proc. 19th Symposium on Graph Drawing (pp. 308-319). (LNCS; Vol. 7034). http://dx.doi.org/10.1007/978-3-642-25878-7_30
Chambers, E. W., Eppstein, D., Goodrich, M. T., & Löffler, M. (2011). Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area. In Proc. 18th Symposium on Graph Drawing (pp. 129-140). (LNCS 6502). https://doi.org/10.1007/978-3-642-18469-7_12
Eppstein, D., Löffler, M., Mumford, E., & Nöllenburg, M. (2011). Optimal 3D Angular Resolution for Low-Degree Graphs. In Proc. 18th Symposium on Graph Drawing (pp. 208-219). (LNCS 6502). https://doi.org/10.1007/978-3-642-18469-7_19
Bose, P., Devroye, L., Löffler, M., Snoeyink, J., & Verma, V. (2011). Almost all Delaunay Triangulations have Stretch Factor Greater than $2$. Computational geometry, 44(2), 121-127. https://doi.org/10.1016/j.comgeo.2010.09.009
Löffler, M., & Mumford, E. (2011). Connected Rectilinear Graphs on Point Sets. Journal of Computational Geometry, 2(1), 1-15. http://jocg.org/index.php/jocg/article/view/40
Other output
Eppstein, D., Goodrich, M. T., Löffler, M., Strash, D., & Trott, L. (2011). Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon (Full). http://arXiv.org/abs/1110.4499
Eppstein, D., Goodrich, M. T., Löffler, M., Strash, D., & Trott, L. (2011). Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon (Short). http://arXiv.org/abs/1108.4675
Eppstein, D., & Löffler, M. (2011). Bounds on the Complexity of Halfspace Intersections when the Bounded Faces have Small Dimension. http://arXiv.org/abs/1103.2575
Duncan, C., Eppstein, D., Goodrich, M. T., Kobourov, S., & Löffler, M. (2011). Planar and Poly-Arc Lopmbardi Drawings. http://arXiv.org/abs/1109.0345
2010
Scholarly publications
Eppstein, D., Löffler, M., & Strash, D. (2010). Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time. In Proc. 21st International Symposium on Algorithms and Computation (pp. 403-414). (LNCS 6506). https://doi.org/10.1007/978-3-642-17517-6_36
Buchin, K., Cabello, S., Gudmundsson, J., Löffler, M., Luo, J., Rote, G., Silveira, R. I., Speckmann, B., & Wolle, T. (2010). Finding the Most Relevant Fragments in Networks. Journal of Graph Algorithms and Applications, 14(2), 307-336. https://doi.org/10.7155/jgaa.00209
Other output
Eppstein, D., Löffler, M., & Strash, D. (2010). Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time. http://arXiv.org/abs/1006.5440
Chambers, E. W., Eppstein, D., Goodrich, M. T., & Löffler, M. (2010). Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area. http://arXiv.org/abs/1009.0088
Eppstein, D., Löffler, M., Mumford, E., & Nöllenburg, M. (2010). Optimal 3D Angular Resolution for Low-Degree Graphs. http://arXiv.org/abs/1009.0045
Bose, P., Devroye, L., Löffler, M., Snoeyink, J., & Verma, V. (2010). The spanning ratio of the Delaunay triangulation is greater than $2$. http://arXiv.org/abs/1006.0291
2009
Scholarly publications
Kreveld, M. V., Löffler, M., & Mitchell, J. (2009). Preprocessing Imprecise Points and Splitting Triangulations. (Technical Report Series; No. UU-CS-2009-007). UU BETA ICS Departement Informatica. http://www.cs.uu.nl/research/techreps/UU-CS-2009-007.html
Aronov, B., Kreveld, M. V., Löffler, M., & Silveira, R. I. (2009). Peeling Meshed Potatoes. (Technical Report Series; No. UU-CS-010). UU BETA ICS Departement Informatica. http://www.cs.uu.nl/research/techreps/UU-CS-2009-010.html
Löffler, M., & Phillips, J. (2009). Shape Fitting on Point Sets with Probability Distributions. (Technical Report Series; No. UU-CS-2009-013). UU BETA ICS Departement Informatica. http://www.cs.uu.nl/research/techreps/UU-CS-2009-013.html
Bose, P., Devroye, L., Löffler, M., Snoeyink, J., & Verma, V. (2009). The spanning ratio of the Delaunay triangulation is greater than $2$. In Proc. 21th Canadian Conference on Computational Geometry (pp. 165-167)
Horev, E., Katz, M. J., Krakovski, R., & Löffler, M. (2009). Polychromatic 4-Coloring of Guillotine Subdivisions. Information Processing Letters, 109(13), 690-694. https://doi.org/10.1016/j.ipl.2009.03.006
Löffler, M., & Mumford, E. (2009). Connected Rectilinear Graphs on Point Sets. In Proc. 16th Symposium on Graph Drawing (pp. 313-318). (LNCS 5417). https://doi.org/10.1007/978-3-642-00219-9_30
Professional publications
Löffler, M. (2009). Data Imprecision in Computational Geometry. Utrecht University. http://igitur-archive.library.uu.nl/dissertations/2009-1005-200203/UUindex.html
2008
Scholarly publications
Löffler, M., & Snoeyink, J. (2008). Delaunay Triangulations of Imprecise Points in Linear Time after Preprocessing. In Proc. 24th Symposium on Computational Geometry (pp. 298-304) https://doi.org/10.1145/1377676.1377727
Gray, C., Löffler, M., & Silveira, R. I. (2008). Smoothing Imprecise 1.5D Terrains. (Technical Report Series; No. UU-CS-2008-036). UU BETA ICS Departement Informatica. http://www.cs.uu.nl/research/techreps/UU-CS-2008-036.html
Haverkort, H., Löffler, M., Mumford, E., Snoeyink, J., Speckmann, B., & O'Meara, M. (2008). Colour Patterns for Polychromatic Four-colouring of Rectangular Subdivisions. In Proc. 24th European Workshop on Computational Geometry (pp. 75-78)
Löffler, M., & Mumford, E. (2008). Connected Rectilinear Graphs on Point Sets. http://www.cs.uu.nl/research/techreps/UU-CS-2008-028.html
2007
Scholarly publications
Kreveld, M. V., Löffler, M., & Silveira, R. I. (2007). Optimization for First Order Delaunay Triangulations. (Technical Report Series; No. UU-CS-2007-011). UU BETA ICS Departement Informatica. http://www.cs.uu.nl/research/techreps/UU-CS-2007-011.html
Löffler, M., & Mumford, E. (2007). Rotating Rectilinear Polygons. In Proc. 17th Fall Workshop on Computational Geometry (pp. 85-86)
Borgelt, M. G., Kreveld, M. V., Löffler, M., Luo, J., Merrick, D., Silveira, R. I., & Vahedi, M. (2007). Planar Bichromatic Minimum Spanning Trees. http://www.cs.uu.nl/research/techreps/UU-CS-2007-044.html
2005
Scholarly publications
Kok, T. D., Kreveld, M. V., & Löffler, M. (2005). Generating Realistic Terrains with Higher-Order Delaunay Triangulations. (Technical Report Series; No. UU-CS-020). UU BETA ICS Departement Informatica. http://www.cs.uu.nl/research/techreps/UU-CS-2005-020.html
Professional publications
Löffler, M. (2005). Smallest and Largest Convex Hulls for Imprecise Points. Utrecht University.