Publication:4035663
From MaRDI portal
zbMath0773.68068MaRDI QIDQ4035663
Publication date: 18 May 1993
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Unnamed Item, Unnamed Item, Global Curve Simplification, On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance, Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds, Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance, Streaming algorithms for line simplification, Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails, Fréchet Distance for Uncertain Curves, Universal approximate simplification under the discrete Fréchet distance, Approximate matching of polygonal shapes, Embedding ray intersection graphs and global curve simplification, Four Soviets walk the dog: improved bounds for computing the Fréchet distance, Efficient observer-dependent simplification in polygonal domains, Adaptive dissimilarity index for measuring time series proximity