The following pages link to Maarten Löffler (Q293617):
Displaying 50 items.
- Counting carambolas (Q293619) (← links)
- Category-based routing in social networks: membership dimension and the small-world phenomenon (Q386908) (← links)
- Removing local extrema from imprecise terrains (Q419504) (← links)
- Peeling meshed potatoes (Q534778) (← links)
- The directed Hausdorff distance between imprecise point sets (Q553353) (← links)
- Almost all Delaunay triangulations have stretch factor greater than \(\pi /2\) (Q621930) (← links)
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended (Q644800) (← links)
- Maximum-area triangle in a convex polygon, revisited (Q783698) (← links)
- Multi-colored spanning graphs (Q784473) (← links)
- Folding polyominoes with holes into a cube (Q827332) (← links)
- Mapping multiple regions to the grid with bounded Hausdorff distance (Q832913) (← links)
- Largest and smallest convex hulls for imprecise points (Q848964) (← links)
- Generating realistic terrains with higher-order Delaunay triangulations (Q870427) (← links)
- Polychromatic 4-coloring of guillotine subdivisions (Q989455) (← links)
- Approximating largest convex hulls for imprecise points (Q1002103) (← links)
- Delaunay triangulation of imprecise points in linear time after preprocessing (Q1037646) (← links)
- Planar bichromatic minimum spanning trees (Q1044035) (← links)
- On the complexity of barrier resilience for fat regions and bounded ply (Q1615674) (← links)
- Colored spanning graphs for set visualization (Q1699297) (← links)
- On the complexity of barrier resilience for fat regions (Q1796437) (← links)
- Largest and smallest area triangles on imprecise points (Q1984599) (← links)
- Unit disk representations of embedded trees, outerplanar and multi-legged graphs (Q2151453) (← links)
- Embedding ray intersection graphs and global curve simplification (Q2151460) (← links)
- Minimum color spanning circle of imprecise points (Q2166769) (← links)
- Geometric multicut: shortest fences for separating groups of objects in the plane (Q2207588) (← links)
- Labeling nonograms: boundary labeling for curve arrangements (Q2230415) (← links)
- Optimization for first order Delaunay triangulations (Q2269140) (← links)
- Largest bounding box, smallest diameter, and related problems on imprecise points (Q2269143) (← links)
- Most vital segment barriers (Q2285111) (← links)
- A fully polynomial time approximation scheme for the smallest diameter of imprecise points (Q2304571) (← links)
- Optimizing airspace closure with respect to politicians' egos (Q2347008) (← links)
- Median trajectories (Q2375955) (← links)
- Bounds on the complexity of halfspace intersections when the bounded faces have small dimension (Q2391831) (← links)
- Dynamic stabbing queries with sub-logarithmic local updates for overlapping intervals (Q2399373) (← links)
- Region-based approximation of probability distributions (for visibility between imprecise points among obstacles) (Q2415360) (← links)
- Packing plane spanning trees and paths in complete geometric graphs (Q2628273) (← links)
- Rectangular spiral galaxies are still hard (Q2678258) (← links)
- Minimum color spanning circle in imprecise setup (Q2695293) (← links)
- Minimizing Co-location Potential of Moving Entities (Q2829447) (← links)
- Unions of Onions: Preprocessing Imprecise Points for Fast Onion Layer Decomposition (Q2842184) (← links)
- Dynamic Planar Point Location with Sub-logarithmic Local Updates (Q2842186) (← links)
- Colored Spanning Graphs for Set Visualization (Q2867665) (← links)
- Strict Confluent Drawing (Q2867672) (← links)
- Terrain Visibility with Multiple Viewpoints (Q2872096) (← links)
- Mixed Map Labeling (Q2947031) (← links)
- Linear-Size Universal Point Sets for One-Bend Drawings (Q2959775) (← links)
- Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees (Q2959779) (← links)
- The Flip Diameter of Rectangulations and Convex Subdivisions (Q2965976) (← links)
- (Q2968073) (← links)
- Flow computations on imprecise terrains (Q2968096) (← links)
