The following pages link to Bettina Speckmann (Q283882):
Displaying 50 items.
- Distance-sensitive planar point location (Q283883) (← links)
- Triangulating and guarding realistic polygons (Q390140) (← links)
- Convexity minimizes pseudo-triangulations (Q598549) (← links)
- Empty pseudo-triangles in point sets (Q765318) (← links)
- Diverse partitions of colored points (Q832914) (← links)
- Area-preserving approximations of polygonal paths (Q866543) (← links)
- On rectangular cartograms (Q883236) (← links)
- On minimum weight pseudo-triangulations (Q924080) (← links)
- Efficient algorithms for maximum regression depth (Q938312) (← links)
- On rectilinear duals for vertex-weighted plane graphs (Q1011760) (← links)
- Kinetic collision detection for convex fat objects (Q1016518) (← links)
- Edges and switches, tunnels and bridges (Q1028235) (← links)
- Computing the similarity between moving curves (Q1615772) (← links)
- Locally correct Fréchet matchings (Q1624582) (← links)
- Homotopic \(\mathcal{C}\)-oriented routing with few links and thick edges (Q1693321) (← links)
- Colored spanning graphs for set visualization (Q1699297) (← links)
- Allocating vertex \(\pi\)-guards in simple polygons via pseudo-triangulations (Q1772125) (← links)
- Tight degree bounds for pseudo-triangulations of points (Q1873151) (← links)
- Algorithmic aspects of proportional symbol maps (Q1957642) (← links)
- 10 reasons to get interested in graph drawing (Q2075765) (← links)
- Optimal morphs of planar orthogonal drawings. II (Q2206827) (← links)
- A framework for algorithm stability and its application to kinetic Euclidean MSTs (Q2294738) (← links)
- Angle-restricted Steiner arborescences for flow map layout (Q2354031) (← links)
- Treemaps with bounded aspect ratio (Q2450205) (← links)
- Decompositions, partitions, and coverings with convex polygons and pseudo-triangles (Q2464053) (← links)
- On the number of pseudo-triangulations of certain point sets (Q2474495) (← links)
- Packing plane spanning trees and paths in complete geometric graphs (Q2628273) (← links)
- Flip graphs of bounded degree triangulations (Q2637710) (← links)
- Distance-Sensitive Planar Point Location (Q2842142) (← links)
- Trajectory Grouping Structure (Q2842159) (← links)
- Flip graphs of bounded-degree triangulations (Q2851510) (← links)
- Colored Spanning Graphs for Set Visualization (Q2867665) (← links)
- Strict Confluent Drawing (Q2867672) (← links)
- Area-universal and constrained rectangular layouts (Q2910852) (← links)
- Kinetic Compressed Quadtrees in the Black-Box Model with Applications to Collision Detection for Low-Density Scenes (Q2912856) (← links)
- On the number of regular edge labelings (Q2928592) (← links)
- Column Planarity and Partial Simultaneous Geometric Embedding (Q2936932) (← links)
- Algorithms for Necklace Maps (Q2950591) (← links)
- Towards Characterizing Graphs with a Sliceable Rectangular Dual (Q2959780) (← links)
- Kinetic convex hulls, Delaunay triangulations and connectivity structures in the black-box model (Q2968093) (← links)
- Trajectory grouping structure (Q2970415) (← links)
- Strict Confluent Drawing (Q2970442) (← links)
- Complexity Measures for Mosaic Drawings (Q2980906) (← links)
- Optimizing Regular Edge Labelings (Q3073665) (← links)
- Finding the Most Relevant Fragments in Networks (Q3075611) (← links)
- Angle-Restricted Steiner Arborescences for Flow Map Layout (Q3104619) (← links)
- Treemaps with Bounded Aspect Ratio (Q3104620) (← links)
- An improved lower bound on the minimum number of triangulations (Q3132839) (← links)
- Grouping time-varying data for interactive exploration (Q3132897) (← links)
- Shooting Permanent Rays among Disjoint Polygons in the Plane (Q3143300) (← links)
