The following pages link to Maarten Löffler (Q293617):
Displayed 50 items.
- Unions of Onions: Preprocessing Imprecise Points for Fast Onion Decomposition (Q2968106) (← links)
- Strict Confluent Drawing (Q2970442) (← links)
- Adjacency-preserving spatial treemaps (Q2970446) (← links)
- (Q2978407) (← links)
- EXISTENCE AND COMPUTATION OF TOURS THROUGH IMPRECISE POINTS (Q3007721) (← links)
- Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time (Q3060751) (← links)
- Optimal 3D Angular Resolution for Low-Degree Graphs (Q3073673) (← links)
- Finding the Most Relevant Fragments in Networks (Q3075611) (← links)
- DETECTING COMMUTING PATTERNS BY CLUSTERING SUBTRAJECTORIES (Q3089091) (← links)
- On the complexity of minimum-link path problems (Q3132885) (← links)
- Grouping time-varying data for interactive exploration (Q3132897) (← links)
- Triangulating the Square and Squaring the Triangle: Quadtrees and Delaunay Triangulations are Equivalent (Q3143298) (← links)
- A Refined Definition for Groups of Moving Entities and Its Computation (Q3177903) (← links)
- Connect the Dot: Computing Feed-Links with Minimum Dilation (Q3183440) (← links)
- Delaunay Triangulation of Imprecise Points Simplified and Extended (Q3183447) (← links)
- Planar and Poly-arc Lombardi Drawings (Q3223963) (← links)
- On optimal polyline simplification using the Hausdorff and Fréchet distance (Q3303781) (← links)
- Median Trajectories (Q3586486) (← links)
- Preprocessing Imprecise Points and Splitting Triangulations (Q3596748) (← links)
- Detecting Commuting Patterns by Clustering Subtrajectories (Q3596758) (← links)
- Smoothing Imprecise 1.5D Terrains (Q3602841) (← links)
- Delaunay triangulations of imprecise pointsin linear time after preprocessing (Q3602931) (← links)
- Optimization for First Order Delaunay Triangulations (Q3603525) (← links)
- Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points (Q3603548) (← links)
- Connected Rectilinear Graphs on Point Sets (Q3611865) (← links)
- Shape Fitting on Point Sets with Probability Distributions (Q3639256) (← links)
- The Directed Hausdorff Distance between Imprecise Point Sets (Q3652258) (← links)
- (Q4580143) (← links)
- Homotopy measures for representative trajectories (Q4606296) (← links)
- Lombardi Drawings of Knots and Links (Q4625105) (← links)
- A Refined Definition for Groups of Moving Entities and its Computation (Q4636531) (← links)
- How Many Potatoes Are in a Mesh? (Q4909533) (← links)
- Optimal 3D Angular Resolution for Low-Degree Graphs (Q4913761) (← links)
- SMOOTHING IMPRECISE 1.5D TERRAINS (Q4931729) (← links)
- Segmentation of Trajectories on Nonmonotone Criteria (Q4962220) (← links)
- (Q5057207) (← links)
- Global Curve Simplification (Q5075813) (← links)
- Preprocessing Ambiguous Imprecise Points (Q5088972) (← links)
- (Q5088998) (← links)
- Convex partial transversals of planar regions (Q5091044) (← links)
- (Q5091157) (← links)
- Dynamic smooth compressed quadtrees (Q5115813) (← links)
- On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance (Q5115824) (← links)
- Competitive query strategies for minimising the ply of the potential locations of moving points (Q5174473) (← links)
- Theoretical analysis of beaconless geocast protocols in 1D (Q5195107) (← links)
- Adjacency-Preserving Spatial Treemaps (Q5199239) (← links)
- Flow Computations on Imprecise Terrains (Q5199256) (← links)
- Tracking Moving Objects with Few Handovers (Q5199257) (← links)
- Geometric Computations on Indecisive Points (Q5199271) (← links)
- (Q5207877) (← links)