Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance

This publication has 19 references indexed in Scilit:

• The Approximability of the Exemplar Breakpoint Distance Problem
  2006
• Near-Linear Time Approximation Algorithms for Curve Simplification
  Algorithmica, 2005
• SPACE-EFFICIENT ALGORITHMS FOR APPROXIMATING POLYGONAL CURVES IN TWO-DIMENSIONAL SPACE
  International Journal of Computational Geometry & Applications, 2003
• Efficiently Approximating Polygonal Paths in Three and Higher Dimensions
  Algorithmica, 2002
• Optimal output-sensitive convex hull algorithms in two and three dimensions
  Discrete & Computational Geometry, 1996
• APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
  International Journal of Computational Geometry & Applications, 1996
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
  International Journal of Computational Geometry & Applications, 1995
• On Approximating Polygonal Curves in Two and Three Dimensions
  CVGIP: Graphical Models and Image Processing, 1994
• Measuring the resemblance of polygonal curves
  1992
• Sur quelques points du calcul fonctionnel
  Rendiconti del Circolo Matematico di Palermo Series 2, 1906