Optimal algorithms for symmetry detection in two and three dimensions

DOI10.1007/BF01901268zbMath0617.68042OpenAlexW2123103312MaRDI QIDQ1822243

Jan D. Wolter, Richard A. Volz, Tony C. Woo

Publication date: 1985

Published in: The Visual Computer (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01901268

zbMATH Keywords

symmetryalgorithmspolyhedrasimilaritycomputational geometrypattern matchingpolygonsgraph isomorphismpoint setstime complexities

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Polyhedra and polytopes; regular figures, division of spaces (51M20)

Related Items (9)

Detection of rotational and involutional symmetries and congruity of polyhedra ⋮ A new measure of symmetry and its application to classification of bifurcating structures ⋮ Symmetries of discrete curves and point clouds via trigonometric interpolation ⋮ Full and partial symmetries of non-rigid shapes ⋮ Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces ⋮ Symmetric assembly puzzles are hard, beyond a few pieces ⋮ Fast detection and display of symmetry in outerplanar graphs ⋮ TURNING SHAPE DECISION PROBLEMS INTO MEASURES ⋮ Manifold Intrinsic Similarity

Cites Work

• An application of pattern matching to a problem in geometrical complexity
• On polygon similarity
• A method for detecting structure in polyhedra
• Convex hulls of finite sets of points in two and three dimensions
• Fast Pattern Matching in Strings
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal algorithms for symmetry detection in two and three dimensions