The following pages link to Kevin Buchin (Q312137):
Displaying 50 items.
- Computing the Fréchet distance with a retractable leash (Q312142) (← links)
- Reprint of: Memory-constrained algorithms for simple polygons (Q390167) (← links)
- Distribution-sensitive construction of the greedy spanner (Q527422) (← links)
- A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets (Q612909) (← links)
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended (Q644800) (← links)
- Finding long and similar parts of trajectories (Q654283) (← links)
- Vectors in a box (Q715080) (← links)
- Model-based segmentation and classification of trajectories (Q724245) (← links)
- Computing the greedy spanner in linear space (Q893321) (← links)
- Computing the Fréchet distance between simple polygons (Q934016) (← links)
- Transforming spanning trees: A lower bound (Q1028225) (← links)
- Computing the similarity between moving curves (Q1615772) (← links)
- Locally correct Fréchet matchings (Q1624582) (← links)
- A spanner for the day after (Q2223618) (← links)
- Minimum perimeter-sum partitions in the plane (Q2291459) (← links)
- Progressive simplification of polygonal curves (Q2306367) (← links)
- Angle-restricted Steiner arborescences for flow map layout (Q2354031) (← links)
- Median trajectories (Q2375955) (← links)
- Memory-constrained algorithms for simple polygons (Q2391542) (← links)
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance (Q2408191) (← links)
- Region-based approximation of probability distributions (for visibility between imprecise points among obstacles) (Q2415360) (← links)
- Drawing (complete) binary tanglegrams (Q2428677) (← links)
- There are not too many magic configurations (Q2482202) (← links)
- Recursive geometry of the flow complex and topology of the flow complex filtration (Q2483557) (← links)
- Trajectory Grouping Structure (Q2842159) (← links)
- Computing the Greedy Spanner in Linear Space (Q2849294) (← links)
- Computing the Fréchet Distance with a Retractable Leash (Q2849314) (← links)
- Vertex Deletion for 3D Delaunay Triangulations (Q2849315) (← links)
- Dynamic Point Labeling is Strongly PSPACE-Complete (Q2872091) (← links)
- (Q2928592) (← links)
- Progressive Geometric Algorithms (Q2970436) (← links)
- Adjacency-preserving spatial treemaps (Q2970446) (← links)
- Delaunay triangulations in <i>O</i> (sort( <i>n</i> )) time and more (Q3016253) (← links)
- Optimizing Regular Edge Labelings (Q3073665) (← links)
- Finding the Most Relevant Fragments in Networks (Q3075611) (← links)
- Acyclic Orientation of Drawings (Q3075613) (← links)
- DETECTING COMMUTING PATTERNS BY CLUSTERING SUBTRAJECTORIES (Q3089091) (← links)
- Angle-Restricted Steiner Arborescences for Flow Map Layout (Q3104619) (← links)
- Connect the Dot: Computing Feed-Links with Minimum Dilation (Q3183440) (← links)
- Delaunay Triangulation of Imprecise Points Simplified and Extended (Q3183447) (← links)
- Shortest-Paths Preserving Metro Maps (Q3223983) (← links)
- Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance (Q3511346) (← links)
- Fréchet Distance of Surfaces: Some Simple Hard Cases (Q3586384) (← links)
- On the Number of Spanning Trees a Planar Graph Can Have (Q3586455) (← links)
- Median Trajectories (Q3586486) (← links)
- Detecting Commuting Patterns by Clustering Subtrajectories (Q3596758) (← links)
- (Q3601525) (← links)
- Inflating the cube by shrinking (Q3602864) (← links)
- (Q3602870) (← links)
- On the Number of Cycles in Planar Graphs (Q3608835) (← links)
