scientific article; zbMATH DE number 1424291
From MaRDI portal
Publication:4945503
Recommendations
Cited in
(48)- Morphing of triangular meshes in shape space
- Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D
- Minimum Hausdorff distance under rigid motions and comparison of protein structures
- scientific article; zbMATH DE number 7765371 (Why is no real title available?)
- Noisy colored point set matching
- Simple algorithms for partial point set pattern matching under rigid motion
- Invariant kernel functions for pattern analysis and machine learning
- Pattern matching in doubling spaces
- Matching sets of line segments
- Minimizing the Weighted Directed Hausdorff Distance between Colored Point Sets under Translations and Rigid Motions
- Improved approximation bounds for planar point pattern matching
- Minimizing the weighted directed Hausdorff distance between colored point sets under translations and rigid motions
- Hausdorff matching and Lipschitz optimization
- Approximate congruence in nearly linear time
- Elastic geometric shape matching for point sets under translations
- Small candidate set for translational pattern search
- Between shapes, using the Hausdorff distance
- Structured discrete shape approximation: theoretical complexity and practical algorithm
- Morphing polyhedra with parallel faces: Counterexamples
- scientific article; zbMATH DE number 7561380 (Why is no real title available?)
- Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric
- Discrete and geometric branch and bound algorithms for~medical image registration
- On the performance of the ICP algorithm
- The complexity of the Hausdorff distance
- Shape matching by random sampling
- On the parameterized complexity of \(d\)-dimensional point set pattern matching
- Probabilistic matching of planar regions
- Elastic geometric shape matching for translations under the Manhattan norm
- A new algorithm for computing the minimum Hausdorff distance between two point sets on a line under translation
- Computing the Fréchet distance between simple polygons
- Approximately matching polygonal curves with respect to the Fréchet distance
- Delaunay triangulations approximate anchor hulls
- Checking oriented matroid isomorphism by means of canonical labeling
- Precise Hausdorff distance computation between polygonal meshes
- Morphing triangle contact representations of triangulations
- Computing the Fréchet distance between folded polygons
- scientific article; zbMATH DE number 4066391 (Why is no real title available?)
- Matching point sets with respect to the earth mover's distance
- Morphing Contact Representations of Graphs
- The T-hull approach to transformations of discrete point sets to continua and shape transformations between discontinuous objects using alpha-hulls
- Shape segmentation and matching with flow discretization.
- Approximating the maximum overlap of polygons under translation
- Approximate one-to-one point pattern matching
- Computing realistic terrains from imprecise elevations
- Fast and robust Hausdorff distance computation from triangle mesh to quad mesh in near-zero cases
- FPTAS for minimizing the earth mover's distance under rigid transformations and related problems
- An applied point pattern matching problem: Comparing 2D patterns of protein spots
- Fast Fréchet queries
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4945503)
