Maarten Löffler

According to our database1, Maarten Löffler authored at least 118 papers between 2005 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Design and Automated Generation of Japanese Picture Puzzles.
Comput. Graph. Forum, 2019

Region-Based Approximation of Probability Distributions (for Visibility Between Imprecise Points Among Obstacles).
Algorithmica, 2019

Approximating (k, ℓ)-center clustering for curves.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Geometric Multicut.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

A Manual Comparison of Convex Hull Algorithms (Multimedia Exposition).
Proceedings of the 35th International Symposium on Computational Geometry, 2019

Preprocessing Ambiguous Imprecise Points.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018
Planar and poly-arc Lombardi drawings.
JoCG, 2018

On the complexity of barrier resilience for fat regions and bounded ply.
Comput. Geom., 2018

Colored spanning graphs for set visualization.
Comput. Geom., 2018

Convex Partial Transversals of Planar Regions.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

An Experimental Comparison of Two Definitions for Groups of Moving Entities (Short Paper).
Proceedings of the 10th International Conference on Geographic Information Science, 2018

Graph Drawing Contest Report.
Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

How to Fit a Tree in a Box.
Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

Dynamic Smooth Compressed Quadtrees.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

Width and Bounding Box of Imprecise Points.
Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

Theoretical analysis of beaconless geocast protocols in 1D.
Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics, 2018

2017
Multi-Granular Trend Detection for Time-Series Analysis.
IEEE Trans. Vis. Comput. Graph., 2017

Central trajectories.
JoCG, 2017

Applications of Topology to the Analysis of 1-Dimensional Objects (Dagstuhl Seminar 17072).
Dagstuhl Reports, 2017

Obedient Plane Drawings for Disk Intersection Graphs.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Lombardi Drawings of Knots and Links.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

Graph Drawing Contest Report.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

Dynamic Stabbing Queries with Sub-logarithmic Local Updates for Overlapping Intervals.
Proceedings of the Computer Science - Theory and Applications, 2017

Folding Free-Space Diagrams: Computing the Fréchet Distance between 1-Dimensional Curves (Multimedia Contribution).
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

Discretized Approaches to Schematization.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

On Measures for Groups of Trajectories.
Proceedings of the Societal Geo-innovation, 2017

2016
Range Searching.
Encyclopedia of Algorithms, 2016

Segmentation of Trajectories on Nonmonotone Criteria.
ACM Trans. Algorithms, 2016

Minimizing Co-location Potential of Moving Entities.
SIAM J. Comput., 2016

Counting Carambolas.
Graphs and Combinatorics, 2016

A Refined Definition for Groups of Moving Entities and its Computation.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

Graph Drawing Contest Report.
Proceedings of the Graph Drawing and Network Visualization, 2016

Multi-colored Spanning Graphs.
Proceedings of the Graph Drawing and Network Visualization, 2016

Recognizing a DOG is Hard, But Not When It is Thin and Unit.
Proceedings of the 8th International Conference on Fun with Algorithms, 2016

Homotopy Measures for Representative Trajectories.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

On the Complexity of Minimum-Link Path Problems.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

Grouping Time-Varying Data for Interactive Exploration.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

Critical Placements of a Square or Circle amidst Trajectories for Junction Detection.
Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015
Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract).
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

Linear-Size Universal Point Sets for One-Bend Drawings.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

Graph Drawing Contest Report.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

Trajectory Grouping Structure under Geodesic Distance.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

Automated puzzle difficulty estimation.
Proceedings of the 2015 IEEE Conference on Computational Intelligence and Games, 2015

Mixed Map Labeling.
Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

Region-based Approximation Algorithms for Visibility between Imprecise Locations.
Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, 2015

2014
The Connect-The-Dots family of puzzles: design and automatic generation.
ACM Trans. Graph., 2014

Unions of Onions: Preprocessing Imprecise Points for Fast Onion Decomposition.
JoCG, 2014

The Flip Diameter of Rectangulations and Convex Subdivisions.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Practical Approaches to Partially Guarding a Polyhedral Terrain.
Proceedings of the Geographic Information Science - 8th International Conference, 2014

Graph Drawing Contest Report.
Proceedings of the Graph Drawing - 22nd International Symposium, GD 2014, Würzburg, 2014

Optimizing Airspace Closure with Respect to Politicians' Egos.
Proceedings of the Fun with Algorithms - 7th International Conference, 2014

The Connect-The-Dots Family of Puzzles: The Video.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Packing Plane Spanning Trees and Paths in Complete Geometric Graphs.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
Computing Correlation between Piecewise-Linear Functions.
SIAM J. Comput., 2013

Listing All Maximal Cliques in Large Sparse Real-World Graphs.
ACM Journal of Experimental Algorithmics, 2013

Dynamic Planar Point Location with Sub-logarithmic Local Updates.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Unions of Onions: Preprocessing Imprecise Points for Fast Onion Layer Decomposition.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Segmentation of Trajectories for Non-Monotone Criteria.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Terrain Visibility with Multiple Viewpoints.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Colored Spanning Graphs for Set Visualization.
Proceedings of the Graph Drawing - 21st International Symposium, 2013

Strict Confluent Drawing.
Proceedings of the Graph Drawing - 21st International Symposium, 2013

Competitive query strategies for minimising the ply of the potential locations of moving points.
Proceedings of the Symposuim on Computational Geometry 2013, 2013

Counting Carambolas.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

On the Complexity of Barrier Resilience for Fat Regions.
Proceedings of the Algorithms for Sensor Systems, 2013

2012
Processing aggregated data: the location of clusters in health data.
GeoInformatica, 2012

Removing local extrema from imprecise terrains.
Comput. Geom., 2012

How Many Potatoes Are in a Mesh?
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Planar Lombardi Drawings of Outerpaths.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

2011
Connect the dot: Computing feed-links for network extension.
J. Spatial Information Science, 2011

Existence and Computation of Tours through Imprecise Points.
Int. J. Comput. Geometry Appl., 2011

Almost all Delaunay triangulations have stretch factor greater than pi/2.
Comput. Geom., 2011

Preprocessing Imprecise Points for Delaunay Triangulation: Simplified and Extended.
Algorithmica, 2011

Peeling Meshed Potatoes.
Algorithmica, 2011

Geometric Computations on Indecisive Points.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Tracking Moving Objects with Few Handovers.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Flow Computations on Imprecise Terrains.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Adjacency-Preserving Spatial Treemaps.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Triangulating the Square and Squaring the Triangle: Quadtrees and Delaunay Triangulations are Equivalent.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Planar and Poly-arc Lombardi Drawings.
Proceedings of the Graph Drawing - 19th International Symposium, 2011

Bounds on the complexity of halfspace intersections when the bounded faces have small dimension.
Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

Category-based routing in social networks: Membership dimension and the small-world phenomenon.
Proceedings of the International Conference on Computational Aspects of Social Networks, 2011

2010
Finding the Most Relevant Fragments in Networks.
J. Graph Algorithms Appl., 2010

Delaunay triangulation of imprecise points in linear time after preprocessing.
Comput. Geom., 2010

Largest and Smallest Convex Hulls for Imprecise Points.
Algorithmica, 2010

Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Optimal 3D Angular Resolution for Low-Degree Graphs.
Proceedings of the Graph Drawing - 18th International Symposium, GD 2010, Konstanz, 2010

Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area.
Proceedings of the Graph Drawing - 18th International Symposium, GD 2010, Konstanz, 2010

Median Trajectories.
Proceedings of the Algorithms, 2010

Listing all maximal cliques in sparse graphs in near-optimal time.
Proceedings of the Exact Complexity of NP-hard Problems, 31.10. - 05.11.2010, 2010

Computing similarity between piecewise-linear functions.
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

Shooting bricks with orthogonal laser beams: A first step towards internal/external map labeling.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009
Data Imprecision in Computational Geometry.
PhD thesis, 2009

Planar bichromatic minimum spanning trees.
J. Discrete Algorithms, 2009

Polychromatic 4-coloring of guillotine subdivisions.
Inf. Process. Lett., 2009

Delaunay Triangulation of Imprecise Points Simplified and Extended.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Connect the Dot: Computing Feed-Links with Minimum Dilation.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

The Directed Hausdorff Distance between Imprecise Point Sets.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Shape Fitting on Point Sets with Probability Distributions.
Proceedings of the Algorithms, 2009

Minimizing Slope Change in Imprecise 1.5D terrains.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

The spanning ratio of the Delaunay triangulation is greater than pi/2.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

Detecting Hotspots in Geographic Networks.
Proceedings of the Advances in GIScience, 2009

2008
Approximating largest convex hulls for imprecise points.
J. Discrete Algorithms, 2008

Smoothing Imprecise 1.5D Terrains.
Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

Clusters in Aggregated Health Data.
Proceedings of the Headway in Spatial Data Handling, 2008

Preprocessing Imprecise Points and Splitting Triangulations.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Detecting Commuting Patterns by Clustering Subtrajectories.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Feed-links for network extensions.
Proceedings of the 16th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2008

Connected Rectilinear Graphs on Point Sets.
Proceedings of the Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, 2008

Delaunay triangulations of imprecise pointsin linear time after preprocessing.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007
Approximating Largest Convex Hulls for Imprecise Points.
Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Optimization for First Order Delaunay Triangulations.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Largest Subsets of Triangles in a Triangulation.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006
Largest and Smallest Tours and Convex Hulls for Imprecise Points.
Proceedings of the Algorithm Theory, 2006

2005
Minimizing local minima in terrains with higher-order Delaunay triangulations.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Generating Realistic Terrains with Higher-Order Delaunay Triangulations.
Proceedings of the Algorithms, 2005


  Loading...