Approximate one-to-one point pattern matching (Q450574): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Matching Shapes with a Reference Point / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945503 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Congruence, similarity, and symmetries of geometric objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of \(d\)-dimensional point set pattern matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition of multidimensional point sets with applications to <i>k</i> -nearest-neighbors and <i>n</i> -body potential fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvements on geometric pattern matching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric pattern matching under Euclidean motion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry helps in bottleneck matching and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate decision algorithms for point set congruence / rank
 
Normal rank
Property / cites work
 
Property / cites work: The upper envelope of Voronoi surfaces and its applications / rank
 
Normal rank

Latest revision as of 17:07, 5 July 2024

scientific article
Language Label Description Also known as
English
Approximate one-to-one point pattern matching
scientific article

    Statements

    Approximate one-to-one point pattern matching (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 September 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    point pattern matching
    0 references
    similarity transformations
    0 references
    bottleneck distance
    0 references
    approximation algorithm
    0 references
    0 references