עקוב אחר
Maarten Löffler
Maarten Löffler
Computer Science, Utrecht University
כתובת אימייל מאומתת בדומיין cs.uu.nl
כותרת
צוטט על ידי
צוטט על ידי
שנה
Listing all maximal cliques in large sparse real-world graphs
D Eppstein, M Löffler, D Strash
Journal of Experimental Algorithmics (JEA) 18, 3.1-3.21, 2013
748*2013
Detecting commuting patterns by clustering subtrajectories
K Buchin, M Buchin, J Gudmundsson, M Löffler, J Luo
International Journal of Computational Geometry & Applications 21 (03), 253-282, 2011
2282011
Largest and smallest convex hulls for imprecise points
M Löffler, M van Kreveld
Algorithmica 56 (2), 235-269, 2010
168*2010
Largest bounding box, smallest diameter, and related problems on imprecise points
M Löffler, M van Kreveld
Computational Geometry 43 (4), 419-433, 2010
1202010
Median trajectories
K Buchin, M Buchin, M Van Kreveld, M Löffler, RI Silveira, C Wenk, ...
Algorithmica 66, 595-614, 2013
1002013
Ecological validity of virtual environments to assess human navigation ability
IJM van der Ham, AME Faber, M Venselaar, MJ van Kreveld, M Löffler
Frontiers in psychology 6, 637, 2015
892015
Delaunay triangulations of imprecise pointsin linear time after preprocessing
M Löffler, J Snoeyink
Proceedings of the twenty-fourth annual symposium on Computational geometry …, 2008
842008
Shape fitting on point sets with probability distributions
M Löffler, JM Phillips
European symposium on algorithms, 313-324, 2009
832009
Almost all Delaunay triangulations have stretch factor greater than π/2
P Bose, L Devroye, M Löffler, J Snoeyink, V Verma
Computational Geometry 44 (2), 121-127, 2011
78*2011
Data imprecision in computational geometry
M Löffler
Utrecht Univesity, 2009
682009
Generating realistic terrains with higher-order Delaunay triangulations
T De Kok, M Van Kreveld, M Löffler
Computational Geometry 36 (1), 52-65, 2007
572007
Geometric computations on indecisive points
A Jørgensen, M Löffler, J Phillips
Algorithms and Data Structures, 536-547, 2011
56*2011
Preprocessing imprecise points for Delaunay triangulation: Simplified and extended
K Buchin, M Löffler, P Morin, W Mulzer
Algorithmica, 1-20, 2011
56*2011
Approximating (k, )-center clustering for curves
K Buchin, A Driemel, J Gudmundsson, M Horton, I Kostitsyna, M Löffler, ...
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
512019
Segmentation of trajectories on nonmonotone criteria
B Aronov, A Driemel, MV Kreveld, M Löffler, F Staals
ACM Transactions on Algorithms (TALG) 12 (2), 1-28, 2015
482015
Preprocessing imprecise points and splitting triangulations
M Van Kreveld, M Löffler, JSB Mitchell
SIAM Journal on Computing 39 (7), 2990-3000, 2010
422010
The directed Hausdorff distance between imprecise point sets
C Knauer, M Löffler, M Scherfenberg, T Wolle
Theoretical Computer Science, 2011
372011
Drawing graphs in the plane with a prescribed outer face and polynomial area
EW Chambers, D Eppstein, MT Goodrich, M Löffler
Graph Drawing: 18th International Symposium, GD 2010, Konstanz, Germany …, 2011
372011
Planar and poly-arc Lombardi drawings
CA Duncan, D Eppstein, MT Goodrich, SG Kobourov, M Löffler
Graph Drawing: 19th International Symposium, GD 2011, Eindhoven, The …, 2012
362012
Adjacency-preserving spatial treemaps
K Buchin, D Eppstein, M Löffler, M Nöllenburg, RI Silveira
Algorithms and Data Structures: 12th International Symposium, WADS 2011, New …, 2011
342011
המערכת אינה יכולה לבצע את הפעולה כעת. נסה שוב מאוחר יותר.
מאמרים 1–20