scientific article; zbMATH DE number 176499
From MaRDI portal
Publication:4035663
zbMATH Open0773.68068MaRDI QIDQ4035663FDOQ4035663
Authors: Michael Godau 
Publication date: 18 May 1993
Title of this publication is not available (Why is that?)
Recommendations
Cited In (24)
- Title not available (Why is that?)
- Global Curve Simplification
- Tighter connections between Formula-SAT and shaving logs
- Approximation algorithms for geometrical distance problems that are not solvable exactly
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance
- Streaming algorithms for line simplification
- Polygonal chain approximation: A query based approach
- Title not available (Why is that?)
- Fréchet Distance for Uncertain Curves
- Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance
- Embedding ray intersection graphs and global curve simplification
- Adaptive dissimilarity index for measuring time series proximity
- Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails
- Title not available (Why is that?)
- Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance
- Approximate matching of polygonal shapes
- Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
- Algorithms and Computation
- On optimal polyline simplification using the Hausdorff and Fréchet distance
- Universal approximate simplification under the discrete Fréchet distance
- A new metric between polygons, and how to compute it
- A fast algorithm for approximating the detour of a polygonal chain.
- Efficient observer-dependent simplification in polygonal domains
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035663)
