Computing the Fréchet distance between piecewise smooth curves (Q883235): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.comgeo.2005.01.004 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.comgeo.2005.01.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2168261576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching planar maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2762787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slowing down sorting networks to obtain faster sorting algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytic properties of plane offset curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4797599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voronoi diagrams and offset curves of curvilinear polygons. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COMGEO.2005.01.004 / rank
 
Normal rank

Latest revision as of 06:53, 10 December 2024

scientific article
Language Label Description Also known as
English
Computing the Fréchet distance between piecewise smooth curves
scientific article

    Statements

    Computing the Fréchet distance between piecewise smooth curves (English)
    0 references
    0 references
    4 June 2007
    0 references
    Considering two polygonal curves, \textit{H. Alt} and \textit{M. Godau} [Int. J. Comput. Geom. Appl. 5, No. 1--2, 75--91 (1995; Zbl 0941.68809)] initiated the study of Fréchet distance from a computational point of view. Considering here a more general type of curves, the author shows that the number of steps for solving the decision problem is not larger than for the polygonal paths. It is further shown that under stronger conditions on the curves the optimization problem can be solved in a time which matches the running time for the polygonal case.
    0 references
    0 references
    shape matching
    0 references
    Frechet distance
    0 references
    polygonal curves
    0 references

    Identifiers