Maarten Löffler
Maarten Löffler
Computer Science, Utrecht University
Dirección de correo verificada de cs.uu.nl
TítuloCitado porAño
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, 2013
279*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
1582011
Largest and smallest convex hulls for imprecise points
M Löffler, M van Kreveld
Algorithmica 56 (2), 235-269, 2010
127*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
892010
Median trajectories
K Buchin, M Buchin, M Van Kreveld, M Löffler, RI Silveira, C Wenk, ...
Algorithmica 66 (3), 595-614, 2013
692013
Delaunay triangulation of imprecise points in linear time after preprocessing
M Löffler, J Snoeyink
Computational Geometry 43 (3), 234-242, 2010
632010
Shape fitting on point sets with probability distributions
M Löffler, JM Phillips
European Symposium on Algorithms, 313-324, 2009
602009
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
55*2011
Data imprecision in computational geometry
M Löffler
Utrecht Univesity, 2009
492009
Generating realistic terrains with higher-order Delaunay triangulations
T De Kok, M Van Kreveld, M Löffler
Computational Geometry 36 (1), 52-65, 2007
472007
Geometric computations on indecisive points
A Jørgensen, M Löffler, J Phillips
Algorithms and Data Structures, 536-547, 2011
45*2011
Preprocessing imprecise points and splitting triangulations
M Van Kreveld, M Löffler, JSB Mitchell
SIAM Journal on Computing 39 (7), 2990-3000, 2010
372010
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
352015
Preprocessing imprecise points for Delaunay triangulation: Simplified and extended
K Buchin, M Löffler, P Morin, W Mulzer
Algorithmica, 1-20, 2011
35*2011
Segmentation of trajectories on nonmonotone criteria
B Aronov, A Driemel, MV Kreveld, M Löffler, F Staals
ACM Transactions on Algorithms (TALG) 12 (2), 26, 2016
332016
Planar and poly-arc Lombardi drawings
CA Duncan, D Eppstein, MT Goodrich, SG Kobourov, M Löffler
International Symposium on Graph Drawing, 308-319, 2011
322011
The directed Hausdorff distance between imprecise point sets
C Knauer, M Löffler, M Scherfenberg, T Wolle
Theoretical Computer Science, 2011
262011
Adjacency-preserving spatial treemaps
K Buchin, D Eppstein, M Löffler, M Nöllenburg, RI Silveira
Workshop on Algorithms and Data Structures, 159-170, 2011
252011
Drawing graphs in the plane with a prescribed outer face and polynomial area
EW Chambers, D Eppstein, MT Goodrich, M Löffler
International Symposium on Graph Drawing, 129-140, 2010
252010
Triangulating the square and squaring the triangle: quadtrees and Delaunay triangulations are equivalent
M Loffler, W Mulzer
SIAM Journal on Computing 41 (4), 941-974, 2012
242012
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20