Approximate input sensitive algorithms for point pattern matching
From MaRDI portal
Publication:733152
Recommendations
- An Efficient Approximation Algorithm for Point Pattern Matching Under Noise
- Combinatorial and experimental methods for approximate point pattern matching
- Combinatorial Pattern Matching
- Approximate one-to-one point pattern matching
- Algorithms and Data Structures
- Improved approximation bounds for planar point pattern matching
- Approximating Approximate Pattern Matching
- Point set pattern matching in \(d\)-dimensions
- Approximation algorithms for aligning points
Cites work
- scientific article; zbMATH DE number 1241835 (Why is no real title available?)
- Approximate Range Searching: The Absolute Model
- Approximate decision algorithms for point set congruence
- Combinatorial and experimental methods for approximate point pattern matching
- Cutting hyperplanes for divide-and-conquer
- Distribution of distances and triangles in a point set and algorithms for computing the largest common point sets
- Extremal problems in discrete geometry
- Geometric pattern matching under Euclidean motion
- Improved approximation bounds for planar point pattern matching
- On Sets of Distances of n Points
- Point set pattern matching in 3-D
- Selecting distances in the plane
- The upper envelope of Voronoi surfaces and its applications
Cited in
(18)- An Efficient Approximation Algorithm for Point Pattern Matching Under Noise
- Simple algorithms for partial point set pattern matching under rigid motion
- A simple algorithm for approximate partial point set pattern matching under rigid motion
- Output sensitive algorithms for approximate incidences and their applications
- Output sensitive algorithms for approximate incidences and their applications
- Combinatorial and experimental methods for approximate point pattern matching
- Matching sets of line segments
- Improved approximation bounds for planar point pattern matching
- Efficient algorithms for shape and pattern matching.
- Geometric pattern matching for point sets in the plane under similarity transformations
- scientific article; zbMATH DE number 2011843 (Why is no real title available?)
- Point pattern matching algorithm for planar point sets under Euclidean transform
- Combinatorial Pattern Matching
- Ant colony optimization based binary search for efficient point pattern matching in images
- Algorithms and Data Structures
- Curvature based shape detection
- Approximate one-to-one point pattern matching
- Efficient point pattern matching algorithm for planar point sets under transform of translation, rotation and scale
This page was built for publication: Approximate input sensitive algorithms for point pattern matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q733152)
