Congruence, similarity, and symmetries of geometric objects
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3887059 (Why is no real title available?)
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 3760882 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 3497890 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3358052 (Why is no real title available?)
- An optimal algorithm for geometrical congruence
- Checking similarity of planar figures
- Identification of algebraic numbers
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Optimal algorithms for finding the symmetries of a planar point set
Cited in
(58)- Search for similarity transformation between image point clouds using geometric algebra for conics
- Method for evaluating the resemblance of images based on similarity transformations
- Linear time algorithms for testing approximate congruence in the plane
- ANALOG PARALLEL ALGORITHMS FOR COMPUTATIONAL GEOMETRY
- Finding Largest Common Point Sets
- An isometry classification of periodic point sets
- scientific article; zbMATH DE number 2032370 (Why is no real title available?)
- Noisy colored point set matching
- Manifold Intrinsic Similarity
- On the approximation of largest common subtrees and largest common point sets
- Simple algorithms for partial point set pattern matching under rigid motion
- An approach for the estimation of the precision of a real object from its digitization
- Pattern matching in doubling spaces
- Matching sets of line segments
- Symmetries of discrete curves and point clouds via trigonometric interpolation
- Involutions of polynomially parametrized surfaces
- Bottleneck partial-matching Voronoi diagrams and applications
- Improved approximation bounds for planar point pattern matching
- Exact and approximate computational geometry solutions of an unrestricted point set stereo matching problem
- scientific article; zbMATH DE number 2068455 (Why is no real title available?)
- ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES
- Approximate matching of polygonal shapes
- Approximate congruence in nearly linear time
- Point matching under non-uniform distortions.
- AN APPROXIMATE MORPHING BETWEEN POLYLINES
- Testing congruence and symmetry for general 3-dimensional objects.
- Geometric pattern matching under Euclidean motion
- Testing approximate symmetry in the plane is NP-hard
- A new measure of symmetry and its application to classification of bifurcating structures
- Full and partial symmetries of non-rigid shapes
- Improvements on geometric pattern matching problems
- Detecting symmetries of rational plane and space curves
- Detection of rotational and involutional symmetries and congruity of polyhedra
- The translation square map and approximate congruence
- Symmetry detection of rational space curves from their curvature and torsion
- On the parameterized complexity of \(d\)-dimensional point set pattern matching
- The Computational Geometry of Comparing Shapes
- Approximate decision algorithms for approximate congruence
- The upper envelope of Voronoi surfaces and its applications
- On finding maximum-cardinality symmetric subsets
- Bipartite diameter and other measures under translation
- The parameterized complexity of geometric graph isomorphism
- Projective and affine symmetries and equivalences of rational and polynomial surfaces
- Optimal algorithms for finding the symmetries of a planar point set
- Approximate decision algorithms for point set congruence
- New error measures and methods for realizing protein graphs from distance data
- Convex set symmetry measurement using Blaschke addition
- An optimal algorithm for geometrical congruence
- AN FPTAS FOR COMPUTING THE SIMILARITY OF THREE-DIMENSIONAL POINT SETS
- Point set pattern matching in \(d\)-dimensions
- Generalized approximate algorithms for point set congruence
- Approximate one-to-one point pattern matching
- AN OPTIMAL MORPHING BETWEEN POLYLINES
- On determining the congruence of point sets in \(d\) dimensions
- scientific article; zbMATH DE number 7559117 (Why is no real title available?)
- An algorithm for canonical forms of finite subsets of \(\mathbb {Z}^d\) up to affinities
- FPTAS for minimizing the earth mover's distance under rigid transformations and related problems
- On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees
This page was built for publication: Congruence, similarity, and symmetries of geometric objects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1822962)
