The following pages link to (Q4945503):
Displayed 44 items.
- Checking oriented matroid isomorphism by means of canonical labeling (Q387862) (← links)
- Shape matching by random sampling (Q441886) (← links)
- Approximate one-to-one point pattern matching (Q450574) (← links)
- Minimum Hausdorff distance under rigid motions and comparison of protein structures (Q473041) (← links)
- Approximating the maximum overlap of polygons under translation (Q527417) (← links)
- Minimizing the weighted directed Hausdorff distance between colored point sets under translations and rigid motions (Q620951) (← links)
- Precise Hausdorff distance computation between polygonal meshes (Q625134) (← links)
- Noisy colored point set matching (Q628337) (← links)
- Approximately matching polygonal curves with respect to the Fréchet distance (Q705548) (← links)
- Between shapes, using the Hausdorff distance (Q824335) (← links)
- Pattern matching in doubling spaces (Q832835) (← links)
- Delaunay triangulations approximate anchor hulls (Q857062) (← links)
- Computing the Fréchet distance between folded polygons (Q904083) (← links)
- Computing the Fréchet distance between simple polygons (Q934016) (← links)
- On the performance of the ICP algorithm (Q934025) (← links)
- A new algorithm for computing the minimum Hausdorff distance between two point sets on a line under translation (Q963332) (← links)
- Morphing polyhedra with parallel faces: Counterexamples (Q1025295) (← links)
- Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric (Q1037776) (← links)
- Probabilistic matching of planar regions (Q1037777) (← links)
- An applied point pattern matching problem: Comparing 2D patterns of protein spots (Q1289026) (← links)
- Elastic geometric shape matching for translations under the Manhattan norm (Q1615782) (← links)
- Fast and robust Hausdorff distance computation from triangle mesh to quad mesh in near-zero cases (Q1644364) (← links)
- Discrete and geometric branch and bound algorithms for~medical image registration (Q1761852) (← links)
- Approximate congruence in nearly linear time (Q1869745) (← links)
- Fast Fréchet queries (Q1947991) (← links)
- Small candidate set for translational pattern search (Q2088592) (← links)
- On the parameterized complexity of \(d\)-dimensional point set pattern matching (Q2380044) (← links)
- Invariant kernel functions for pattern analysis and machine learning (Q2384155) (← links)
- FPTAS for minimizing the earth mover's distance under rigid transformations and related problems (Q2408088) (← links)
- Hausdorff matching and Lipschitz optimization (Q2457916) (← links)
- Matching point sets with respect to the earth mover's distance (Q2462736) (← links)
- Improved approximation bounds for planar point pattern matching (Q2480906) (← links)
- Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D (Q2482197) (← links)
- Simple algorithms for partial point set pattern matching under rigid motion (Q2498655) (← links)
- Matching sets of line segments (Q2662685) (← links)
- Elastic Geometric Shape Matching for Point Sets under Translations (Q3449855) (← links)
- MORPHING OF TRIANGULAR MESHES IN SHAPE SPACE (Q4923352) (← links)
- Morphing Contact Representations of Graphs (Q5088937) (← links)
- (Q5091017) (← links)
- Minimizing the Weighted Directed Hausdorff Distance between Colored Point Sets under Translations and Rigid Motions (Q5321701) (← links)
- Morphing triangle contact representations of triangulations (Q6050235) (← links)
- (Q6065409) (← links)
- The complexity of the Hausdorff distance (Q6145675) (← links)
- (Q6179335) (← links)