Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Maarten Löffler
2010 – today
- 2013
[j25]Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira, Carola Wenk, Lionov Wiratma: Median Trajectories. Algorithmica 66(3): 595-614 (2013)- [j24]David Eppstein, Maarten Löffler, Elena Mumford, Martin Nöllenburg: Optimal 3D Angular Resolution for Low-Degree Graphs. J. Graph Algorithms Appl. 17(3): 173-200 (2013)
- [c37]Boris Aronov, Anne Driemel, Marc J. van Kreveld, Maarten Löffler, Frank Staals: Segmentation of Trajectories for Non-Monotone Criteria. SODA 2013: 1897-1911
- [i21]Matias Korman, Maarten Löffler, Rodrigo I. Silveira, Darren Strash: On the Complexity of Barrier Resilience for Fat Regions. CoRR abs/1302.4707 (2013)
- [i20]
- 2012
- [j23]Chris Gray, Frank Kammer, Maarten Löffler, Rodrigo I. Silveira: Removing local extrema from imprecise terrains. Comput. Geom. 45(7): 334-349 (2012)
- [j22]Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Maarten Löffler, Jun Luo, Rodrigo I. Silveira: Processing aggregated data: the location of clusters in health data. GeoInformatica 16(3): 497-521 (2012)
- [j21]Erin W. Chambers, David Eppstein, Michael T. Goodrich, Maarten Löffler: Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area. J. Graph Algorithms Appl. 16(2): 243-259 (2012)
- [j20]Maarten Löffler, Wolfgang Mulzer: Triangulating the Square and Squaring the Triangle: Quadtrees and Delaunay Triangulations are Equivalent. SIAM J. Comput. 41(4): 941-974 (2012)
- [c36]Maarten Löffler, Martin Nöllenburg: Planar Lombardi Drawings of Outerpaths. Graph Drawing 2012: 561-562
- [c35]Marc J. van Kreveld, Maarten Löffler, János Pach: How Many Potatoes Are in a Mesh? ISAAC 2012: 166-176
- [i19]Maarten Löffler, Joe Simons, Darren Strash: Dynamic Planar Point Location with Sub-Logarithmic Local Updates. CoRR abs/1204.4714 (2012)
- [i18]Allan Jørgensen, Maarten Löffler, Jeff M. Phillips: Geometric Computations on Indecisive and Uncertain Points. CoRR abs/1205.0273 (2012)
- [i17]Maarten Löffler, Wolfgang Mulzer: Triangulating the Square and Squaring the Triangle: Quadtrees and Delaunay Triangulations are Equivalent. CoRR abs/1205.4738 (2012)
- [i16]Marc J. van Kreveld, Maarten Löffler, János Pach: How Many Potatoes are in a Mesh? CoRR abs/1209.3954 (2012)
- 2011
- [j19]Boris Aronov, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira: Peeling Meshed Potatoes. Algorithmica 60(2): 349-367 (2011)
- [j18]Kevin Buchin, Maarten Löffler, Pat Morin, Wolfgang Mulzer: Preprocessing Imprecise Points for Delaunay Triangulation: Simplified and Extended. Algorithmica 61(3): 674-693 (2011)
- [j17]Prosenjit Bose, Luc Devroye, Maarten Löffler, Jack Snoeyink, Vishal Verma: Almost all Delaunay triangulations have stretch factor greater than pi/2. Comput. Geom. 44(2): 121-127 (2011)
- [j16]Maarten Löffler: Existence and Computation of Tours through Imprecise Points. Int. J. Comput. Geometry Appl. 21(1): 1-24 (2011)
- [j15]Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Maarten Löffler, Jun Luo: Detecting Commuting Patterns by Clustering Subtrajectories. Int. J. Comput. Geometry Appl. 21(3): 253-282 (2011)
- [j14]
- [j13]Boris Aronov, Kevin Buchin, Maike Buchin, Bart M. P. Jansen, Tom de Jong, Marc J. van Kreveld, Maarten Löffler, Jun Luo, Rodrigo I. Silveira, Bettina Speckmann: Connect the dot: Computing feed-links for network extension. J. Spatial Information Science 3(1): 3-31 (2011)
- [j12]Christian Knauer, Maarten Löffler, Marc Scherfenberg, Thomas Wolle: The directed Hausdorff distance between imprecise point sets. Theor. Comput. Sci. 412(32): 4173-4186 (2011)
- [c34]David Eppstein, Michael T. Goodrich, Maarten Löffler, Darren Strash, Lowell Trott: Category-based routing in social networks: Membership dimension and the small-world phenomenon. CASoN 2011: 102-107
- [c33]David Eppstein, Maarten Löffler: Bounds on the complexity of halfspace intersections when the bounded faces have small dimension. Symposium on Computational Geometry 2011: 361-369
- [c32]Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Maarten Löffler: Planar and Poly-arc Lombardi Drawings. Graph Drawing 2011: 308-319
- [c31]Maarten Löffler, Wolfgang Mulzer: Triangulating the Square and Squaring the Triangle: Quadtrees and Delaunay Triangulations are Equivalent. SODA 2011: 1759-1777
- [c30]Kevin Buchin, David Eppstein, Maarten Löffler, Martin Nöllenburg, Rodrigo I. Silveira: Adjacency-Preserving Spatial Treemaps. WADS 2011: 159-170
- [c29]Anne Driemel, Herman J. Haverkort, Maarten Löffler, Rodrigo I. Silveira: Flow Computations on Imprecise Terrains. WADS 2011: 350-361
- [c28]David Eppstein, Michael T. Goodrich, Maarten Löffler: Tracking Moving Objects with Few Handovers. WADS 2011: 362-373
- [c27]Allan Jørgensen, Maarten Löffler, Jeff M. Phillips: Geometric Computations on Indecisive Points. WADS 2011: 536-547
- [i15]David Eppstein, Maarten Löffler: Bounds on the Complexity of Halfspace Intersections when the Bounded Faces have Small Dimension. CoRR abs/1103.2575 (2011)
- [i14]David Eppstein, Michael T. Goodrich, Maarten Löffler: Tracking Moving Objects with Few Handovers. CoRR abs/1105.0392 (2011)
- [i13]Kevin Buchin, David Eppstein, Maarten Löffler, Martin Nöllenburg, Rodrigo I. Silveira: Adjacency-Preserving Spatial Treemaps. CoRR abs/1105.0398 (2011)
- [i12]David Eppstein, Michael T. Goodrich, Maarten Löffler, Darren Strash, Lowell Trott: Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon (Short). CoRR abs/1108.4675 (2011)
- [i11]Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Maarten Löffler: Planar and Poly-Arc Lombardi Drawings. CoRR abs/1109.0345 (2011)
- [i10]David Eppstein, Michael T. Goodrich, Maarten Löffler, Darren Strash, Lowell Trott: Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon (Full). CoRR abs/1110.4499 (2011)
- [i9]Anne Driemel, Herman J. Haverkort, Maarten Löffler: Flow Computations on Imprecise Terrains. CoRR abs/1111.1651 (2011)
- 2010
- [j11]Maarten Löffler, Marc J. van Kreveld: Largest and Smallest Convex Hulls for Imprecise Points. Algorithmica 56(2): 235-269 (2010)
- [j10]Maarten Löffler, Jack Snoeyink: Delaunay triangulation of imprecise points in linear time after preprocessing. Comput. Geom. 43(3): 234-242 (2010)
- [j9]Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira: Optimization for first order Delaunay triangulations. Comput. Geom. 43(4): 377-394 (2010)
- [j8]Maarten Löffler, Marc J. van Kreveld: Largest bounding box, smallest diameter, and related problems on imprecise points. Comput. Geom. 43(4): 419-433 (2010)
- [j7]Chris Gray, Maarten Löffler, Rodrigo I. Silveira: Smoothing Imprecise 1.5D Terrains. Int. J. Comput. Geometry Appl. 20(4): 381-414 (2010)
- [j6]Kevin Buchin, Sergio Cabello, Joachim Gudmundsson, Maarten Löffler, Jun Luo, Günter Rote, Rodrigo I. Silveira, Bettina Speckmann, Thomas Wolle: Finding the Most Relevant Fragments in Networks. J. Graph Algorithms Appl. 14(2): 307-336 (2010)
- [j5]Marc J. van Kreveld, Maarten Löffler, Joseph S. B. Mitchell: Preprocessing Imprecise Points and Splitting Triangulations. SIAM J. Comput. 39(7): 2990-3000 (2010)
- [c26]Maarten Löffler, Martin Nöllenburg: Shooting bricks with orthogonal laser beams: A first step towards internal/external map labeling. CCCG 2010: 203-206
- [c25]Pankaj K. Agarwal, Boris Aronov, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira: Computing similarity between piecewise-linear functions. Symposium on Computational Geometry 2010: 375-383
- [c24]Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira, Carola Wenk, Lionov Wiratma: Median Trajectories. ESA (1) 2010: 463-474
- [c23]Erin W. Chambers, David Eppstein, Michael T. Goodrich, Maarten Löffler: Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area. Graph Drawing 2010: 129-140
- [c22]David Eppstein, Maarten Löffler, Elena Mumford, Martin Nöllenburg: Optimal 3D Angular Resolution for Low-Degree Graphs. Graph Drawing 2010: 208-219
- [c21]David Eppstein, Maarten Löffler, Darren Strash: Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time. ISAAC (1) 2010: 403-414
- [i8]Chris Gray, Frank Kammer, Maarten Löffler, Rodrigo I. Silveira: Removing Local Extrema from Imprecise Terrains. CoRR abs/1002.2580 (2010)
- [i7]Prosenjit Bose, Luc Devroye, Maarten Löffler, Jack Snoeyink, Vishal Verma: The dilation of the Delaunay triangulation is greater than π/2. CoRR abs/1006.0291 (2010)
- [i6]David Eppstein, Maarten Löffler, Darren Strash: Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time. CoRR abs/1006.5440 (2010)
- [i5]David Eppstein, Maarten Löffler, Elena Mumford, Martin Nöllenburg: Optimal 3D Angular Resolution for Low-Degree Graphs. CoRR abs/1009.0045 (2010)
- [i4]Erin W. Chambers, David Eppstein, Michael T. Goodrich, Maarten Löffler: Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area. CoRR abs/1009.0088 (2010)
2000 – 2009
- 2009
- [j4]Elad Horev, Matthew J. Katz, Roi Krakovski, Maarten Löffler: Polychromatic 4-coloring of guillotine subdivisions. Inf. Process. Lett. 109(13): 690-694 (2009)
- [j3]Magdalene G. Borgelt, Marc J. van Kreveld, Maarten Löffler, Jun Luo, Damian Merrick, Rodrigo I. Silveira, Mostafa Vahedi: Planar bichromatic minimum spanning trees. J. Discrete Algorithms 7(4): 469-478 (2009)
- [c20]Kevin Buchin, Sergio Cabello, Joachim Gudmundsson, Maarten Löffler, Jun Luo, Günter Rote, Rodrigo I. Silveira, Bettina Speckmann, Thomas Wolle: Detecting Hotspots in Geographic Networks. AGILE Conf. 2009: 217-231
- [c19]Chris Gray, Maarten Löffler, Rodrigo I. Silveira: Minimizing Slope Change in Imprecise 1.5D terrains. CCCG 2009: 55-58
- [c18]Prosenjit Bose, Luc Devroye, Maarten Löffler, Jack Snoeyink, Vishal Verma: The spanning ratio of the Delaunay triangulation is greater than pi/2. CCCG 2009: 165-167
- [c17]Maarten Löffler, Jeff M. Phillips: Shape Fitting on Point Sets with Probability Distributions. ESA 2009: 313-324
- [c16]Christian Knauer, Maarten Löffler, Marc Scherfenberg, Thomas Wolle: The Directed Hausdorff Distance between Imprecise Point Sets. ISAAC 2009: 720-729
- [c15]Boris Aronov, Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Maarten Löffler, Jun Luo, Rodrigo I. Silveira, Bettina Speckmann: Connect the Dot: Computing Feed-Links with Minimum Dilation. WADS 2009: 49-60
- [c14]Kevin Buchin, Maarten Löffler, Pat Morin, Wolfgang Mulzer: Delaunay Triangulation of Imprecise Points Simplified and Extended. WADS 2009: 131-143
- [i3]Christian Knauer, Maarten Löffler, Marc Scherfenberg, Thomas Wolle: The directed Hausdorff distance between imprecise point sets. CoRR abs/0909.4642 (2009)
- 2008
- [j2]Marc J. van Kreveld, Maarten Löffler: Approximating largest convex hulls for imprecise points. J. Discrete Algorithms 6(4): 583-594 (2008)
- [c13]Maarten Löffler, Jack Snoeyink: Delaunay triangulations of imprecise pointsin linear time after preprocessing. Symposium on Computational Geometry 2008: 298-304
- [c12]Maarten Löffler, Elena Mumford: Connected Rectilinear Graphs on Point Sets. Graph Drawing 2008: 313-318
- [c11]Boris Aronov, Kevin Buchin, Maike Buchin, Bart M. P. Jansen, T. de Jong, Marc J. van Kreveld, Maarten Löffler, Jin Luo, Rodrigo I. Silveira, Bettina Speckmann: Feed-links for network extensions. GIS 2008: 35
- [c10]Marc J. van Kreveld, Maarten Löffler, Joseph S. B. Mitchell: Preprocessing Imprecise Points and Splitting Triangulations. ISAAC 2008: 544-555
- [c9]Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Maarten Löffler, Jun Luo: Detecting Commuting Patterns by Clustering Subtrajectories. ISAAC 2008: 644-655
- [c8]Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Maarten Löffler, Jun Luo, Rodrigo I. Silveira: Clusters in Aggregated Health Data. SDH 2008: 77-90
- [c7]Chris Gray, Maarten Löffler, Rodrigo I. Silveira: Smoothing Imprecise 1.5D Terrains. WAOA 2008: 214-226
- [i2]Maarten Löffler, Jeff M. Phillips: Shape Fitting on Point Sets with Probability Distributions. CoRR abs/0812.2967 (2008)
- 2007
- [j1]Thierry de Kok, Marc J. van Kreveld, Maarten Löffler: Generating realistic terrains with higher-order Delaunay triangulations. Comput. Geom. 36(1): 52-65 (2007)
- [c6]Boris Aronov, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira: Largest Subsets of Triangles in a Triangulation. CCCG 2007: 213-216
- [c5]Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira: Optimization for First Order Delaunay Triangulations. WADS 2007: 175-187
- [c4]Maarten Löffler, Marc J. van Kreveld: Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points. WADS 2007: 446-457
- [c3]Maarten Löffler, Marc J. van Kreveld: Approximating Largest Convex Hulls for Imprecise Points. WAOA 2007: 89-102
- 2006
- [c2]Maarten Löffler, Marc J. van Kreveld: Largest and Smallest Tours and Convex Hulls for Imprecise Points. SWAT 2006: 375-387
- 2005
- [c1]Thierry de Kok, Marc J. van Kreveld, Maarten Löffler: Generating Realistic Terrains with Higher-Order Delaunay Triangulations. ESA 2005: 343-354
- [i1]Thierry de Kok, Marc J. van Kreveld, Maarten Löffler: Minimizing local minima in terrains with higher-order Delaunay triangulations. EuroCG 2005: 115-118
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-15 02:45 CEST by the dblp team