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