Congruence, similarity, and symmetries of geometric objects
DOI10.1007/BF02187910zbMATH Open0679.68070OpenAlexW4232428446WikidataQ54309778 ScholiaQ54309778MaRDI QIDQ1822962FDOQ1822962
Authors: Helmut Alt, K. Mehlhorn, Hubert Wagener, Emo Welzl 
Publication date: 1988
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131048
Recommendations
computational geometrytranslationefficient algorithmsrotationsymmetry groupgeometric transformationsreflexionapproximate congruence
Analysis of algorithms and problem complexity (68Q25) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Other geometric groups, including crystallographic groups (20H15) Metric geometry (51F99) Algorithms in computer science (68W99)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Title not available (Why is that?)
- An optimal algorithm for geometrical congruence
- Identification of algebraic numbers
- Optimal algorithms for finding the symmetries of a planar point set
- Checking similarity of planar figures
Cited In (57)
- ANALOG PARALLEL ALGORITHMS FOR COMPUTATIONAL GEOMETRY
- Method for evaluating the resemblance of images based on similarity transformations
- Linear time algorithms for testing approximate congruence in the plane
- Title not available (Why is that?)
- AN FPTAS FOR COMPUTING THE SIMILARITY OF THREE-DIMENSIONAL POINT SETS
- Detecting symmetries of rational plane and space curves
- The Computational Geometry of Comparing Shapes
- An approach for the estimation of the precision of a real object from its digitization
- Pattern matching in doubling spaces
- Full and partial symmetries of non-rigid shapes
- On finding maximum-cardinality symmetric subsets
- Bottleneck partial-matching Voronoi diagrams and applications
- Testing approximate symmetry in the plane is NP-hard
- Symmetries of discrete curves and point clouds via trigonometric interpolation
- Title not available (Why is that?)
- On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees
- Exact and approximate computational geometry solutions of an unrestricted point set stereo matching problem
- Testing congruence and symmetry for general 3-dimensional objects.
- Title not available (Why is that?)
- Point set pattern matching in \(d\)-dimensions
- Improvements on geometric pattern matching problems
- Detection of rotational and involutional symmetries and congruity of polyhedra
- The parameterized complexity of geometric graph isomorphism
- Manifold Intrinsic Similarity
- The upper envelope of Voronoi surfaces and its applications
- Approximate one-to-one point pattern matching
- A new measure of symmetry and its application to classification of bifurcating structures
- Symmetry detection of rational space curves from their curvature and torsion
- The translation square map and approximate congruence
- Approximate decision algorithms for approximate congruence
- Optimal algorithms for finding the symmetries of a planar point set
- Geometric pattern matching under Euclidean motion
- Matching sets of line segments
- Approximate decision algorithms for point set congruence
- Generalized approximate algorithms for point set congruence
- On determining the congruence of point sets in \(d\) dimensions
- Noisy colored point set matching
- Finding Largest Common Point Sets
- AN APPROXIMATE MORPHING BETWEEN POLYLINES
- Bipartite diameter and other measures under translation
- An isometry classification of periodic point sets
- Approximate matching of polygonal shapes
- An optimal algorithm for geometrical congruence
- Improved approximation bounds for planar point pattern matching
- AN OPTIMAL MORPHING BETWEEN POLYLINES
- 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 approximation of largest common subtrees and largest common point sets
- ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES
- 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
- Point matching under non-uniform distortions.
- Involutions of polynomially parametrized surfaces
- Projective and affine symmetries and equivalences of rational and polynomial surfaces
- New error measures and methods for realizing protein graphs from distance data
- Convex set symmetry measurement using Blaschke addition
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)
