Congruence, similarity, and symmetries of geometric objects

DOI10.1007/BF02187910zbMath0679.68070OpenAlexW4232428446WikidataQ54309778 ScholiaQ54309778MaRDI QIDQ1822962

Helmut Alt, Hubert Wagener, Kurt Mehlhorn, Ermo Welzl

Publication date: 1988

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131048

zbMATH Keywords

rotation translation symmetry group computational geometry efficient algorithms geometric transformations reflexion approximate congruence

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Metric geometry (51F99) Other geometric groups, including crystallographic groups (20H15) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Algorithms in computer science (68W99)

Related Items (51)

Approximate decision algorithms for point set congruence ⋮ AN FPTAS FOR COMPUTING THE SIMILARITY OF THREE-DIMENSIONAL POINT SETS ⋮ Exact and approximate computational geometry solutions of an unrestricted point set stereo matching problem ⋮ Pattern matching in doubling spaces ⋮ Point set pattern matching in \(d\)-dimensions ⋮ The parameterized complexity of geometric graph isomorphism ⋮ Improvements on geometric pattern matching problems ⋮ On the parameterized complexity of \(d\)-dimensional point set pattern matching ⋮ Generalized approximate algorithms for point set congruence ⋮ AN OPTIMAL MORPHING BETWEEN POLYLINES ⋮ AN APPROXIMATE MORPHING BETWEEN POLYLINES ⋮ ANALOG PARALLEL ALGORITHMS FOR COMPUTATIONAL GEOMETRY ⋮ On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees ⋮ Detection of rotational and involutional symmetries and congruity of polyhedra ⋮ Bipartite diameter and other measures under translation ⋮ Matching sets of line segments ⋮ FPTAS for minimizing the earth mover's distance under rigid transformations and related problems ⋮ An algorithm for canonical forms of finite subsets of \(\mathbb {Z}^d\) up to affinities ⋮ Symmetry detection of rational space curves from their curvature and torsion ⋮ On determining the congruence of point sets in \(d\) dimensions ⋮ Approximate matching of polygonal shapes ⋮ A new measure of symmetry and its application to classification of bifurcating structures ⋮ Symmetries of discrete curves and point clouds via trigonometric interpolation ⋮ Detecting symmetries of rational plane and space curves ⋮ Involutions of polynomially parametrized surfaces ⋮ Full and partial symmetries of non-rigid shapes ⋮ Linear time algorithms for testing approximate congruence in the plane ⋮ Convex set symmetry measurement using Blaschke addition ⋮ Noisy colored point set matching ⋮ Bottleneck partial-matching Voronoi diagrams and applications ⋮ Approximate one-to-one point pattern matching ⋮ Projective and affine symmetries and equivalences of rational and polynomial surfaces ⋮ Testing congruence and symmetry for general 3-dimensional objects. ⋮ Testing approximate symmetry in the plane is NP-hard ⋮ The translation square map and approximate congruence ⋮ Geometric pattern matching under Euclidean motion ⋮ New error measures and methods for realizing protein graphs from distance data ⋮ Approximate decision algorithms for approximate congruence ⋮ Improved approximation bounds for planar point pattern matching ⋮ The upper envelope of Voronoi surfaces and its applications ⋮ Simple algorithms for partial point set pattern matching under rigid motion ⋮ Unnamed Item ⋮ Manifold Intrinsic Similarity ⋮ An isometry classification of periodic point sets ⋮ The Computational Geometry of Comparing Shapes ⋮ ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES ⋮ On the approximation of largest common subtrees and largest common point sets ⋮ Finding Largest Common Point Sets ⋮ Point matching under non-uniform distortions. ⋮ On finding maximum-cardinality symmetric subsets ⋮ Approximate congruence in nearly linear time

Cites Work

This page was built for publication: Congruence, similarity, and symmetries of geometric objects