scientific article; zbMATH DE number 7053282

zbMath1421.68170MaRDI QIDQ5743403

Anne Driemel, Sariel Har-Peled

Publication date: 10 May 2019

Full work available at URL: https://dl.acm.org/citation.cfm?id=2095146

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Approximation algorithms (68W25)

Related Items

Computing the Fréchet Distance Between Polygons with Holes, Similarity of polygonal curves in the presence of outliers

Uses Software

• robustbase

Cites Work

• Unnamed Item
• Unnamed Item
• Fréchet distance with speed limits
• The design of dynamic data structures
• Improved bounds on the union complexity of fat objects
• New lower bounds for Hopcroft's problem
• Realistic input models for geometric algorithms
• Fast Fréchet Queries
• Generalized Selection and Ranking: Sorted Matrices
• Detecting Commuting Patterns by Clustering Subtrajectories
• The Computational Geometry of Comparing Shapes
• Decomposable searching problems I. Static-to-dynamic transformation
• Matching planar maps
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• Approximate Map Matching with respect to the Fréchet Distance
• The Complexity of the Union of $(\alpha,\beta)$-Covered Objects
• Jaywalking Your Dog: Computing the Fréchet Distance with Shortcuts
• The frechet distance revisited and extended
• Approximating the Fréchet distance for realistic curves in near linear time
• Robust Statistics