scientific article; zbMATH DE number 1424291
From MaRDI portal
Publication:4945503
zbMath0995.65023MaRDI QIDQ4945503
Helmut Alt, Leonidas J. Guibas
Publication date: 24 October 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
interpolationcomputer visionmatchingapproximationcurvescomputational geometryshape simplificationdiscrete geometric shapes
Related Items
Elastic geometric shape matching for translations under the Manhattan norm ⋮ Between shapes, using the Hausdorff distance ⋮ Pattern matching in doubling spaces ⋮ Elastic Geometric Shape Matching for Point Sets under Translations ⋮ On the parameterized complexity of \(d\)-dimensional point set pattern matching ⋮ Fast and robust Hausdorff distance computation from triangle mesh to quad mesh in near-zero cases ⋮ Invariant kernel functions for pattern analysis and machine learning ⋮ Delaunay triangulations approximate anchor hulls ⋮ Minimizing the Weighted Directed Hausdorff Distance between Colored Point Sets under Translations and Rigid Motions ⋮ Matching sets of line segments ⋮ FPTAS for minimizing the earth mover's distance under rigid transformations and related problems ⋮ Checking oriented matroid isomorphism by means of canonical labeling ⋮ Morphing triangle contact representations of triangulations ⋮ Minimizing the weighted directed Hausdorff distance between colored point sets under translations and rigid motions ⋮ Precise Hausdorff distance computation between polygonal meshes ⋮ The complexity of the Hausdorff distance ⋮ Noisy colored point set matching ⋮ Computing the Fréchet distance between folded polygons ⋮ Fast Fréchet queries ⋮ Shape matching by random sampling ⋮ Unnamed Item ⋮ Approximate one-to-one point pattern matching ⋮ Unnamed Item ⋮ Minimum Hausdorff distance under rigid motions and comparison of protein structures ⋮ Computing the Fréchet distance between simple polygons ⋮ On the performance of the ICP algorithm ⋮ Hausdorff matching and Lipschitz optimization ⋮ Matching point sets with respect to the earth mover's distance ⋮ Approximating the maximum overlap of polygons under translation ⋮ A new algorithm for computing the minimum Hausdorff distance between two point sets on a line under translation ⋮ Improved approximation bounds for planar point pattern matching ⋮ Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D ⋮ Discrete and geometric branch and bound algorithms for~medical image registration ⋮ MORPHING OF TRIANGULAR MESHES IN SHAPE SPACE ⋮ Approximately matching polygonal curves with respect to the Fréchet distance ⋮ Simple algorithms for partial point set pattern matching under rigid motion ⋮ Unnamed Item ⋮ Morphing Contact Representations of Graphs ⋮ Morphing polyhedra with parallel faces: Counterexamples ⋮ Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric ⋮ Probabilistic matching of planar regions ⋮ An applied point pattern matching problem: Comparing 2D patterns of protein spots ⋮ Small candidate set for translational pattern search ⋮ Approximate congruence in nearly linear time
