Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Homotopy Measures for Representative Trajectories.

E. Chambers, I. Kostitsyna, M. Löffler, and F. Staals. ESA, volume 57 of LIPIcs, page 27:1-27:17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Thorben Löffler University of Stuttgart

Irina Löffler University of Stuttgart

Dr. rer. nat. Katja Löffler University of Stuttgart

Kornelius Löffler University of Stuttgart

Thomas Löffler University of Stuttgart

Other publications of authors with the same name

Shape Fitting on Point Sets with Probability DistributionsM. Löffler, and J. Phillips. CoRR, (2008)Region-based approximation of probability distributions (for visibility between imprecise points among obstacles).K. Buchin, I. Kostitsyna, M. Löffler, and R. Silveira. CoRR, (2014)On Optimal Min-# Curve Simplification Problem.M. van de Kerkhof, I. Kostitsyna, M. Löffler, M. Mirzanezhad, and C. Wenk. CoRR, (2018)Dynamic smooth compressed quadtrees (Fullversion).I. van der Hoog, E. Khramtcova, and M. Löffler. CoRR, (2017)Terrain Visibility with Multiple Viewpoints.F. Hurtado, M. Löffler, I. Matos, V. Sacristán, M. Saumell, R. Silveira, and F. Staals. Int. J. Comput. Geometry Appl., 24 (4): 275-306 (2014)Connected Rectilinear Graphs on Point Sets.M. Löffler, and E. Mumford. JoCG, 2 (1): 1-15 (2011)Unions of Onions: Preprocessing Imprecise Points for Fast Onion Decomposition.M. Löffler, and W. Mulzer. JoCG, 5 (1): 1-13 (2014)Bounds on the complexity of halfspace intersections when the bounded faces have small dimension.D. Eppstein, and M. Löffler. Symposium on Computational Geometry, page 361-369. ACM, (2011)Folding Free-Space Diagrams: Computing the Fréchet Distance between 1-Dimensional Curves (Multimedia Contribution).K. Buchin, J. Chun, M. Löffler, A. Markovic, W. Meulemans, Y. Okamoto, and T. Shiitada. Symposium on Computational Geometry, volume 77 of LIPIcs, page 64:1-64:5. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2017)Delaunay triangulations of imprecise pointsin linear time after preprocessing.M. Löffler, and J. Snoeyink. Symposium on Computational Geometry, page 298-304. ACM, (2008)