An n log n algorithm for determining the congruity of polyhedra

DOI10.1016/0022-0000(84)90011-4zbMath0546.68052OpenAlexW2061261588MaRDI QIDQ798003

Kōkichi Sugihara

Publication date: 1984

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(84)90011-4

zbMATH Keywords

algorithmcomputational geometryasymptotic time complexitycongruity of polyhedra

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Polyhedra and polytopes; regular figures, division of spaces (51M20) Discrete mathematics in relation to computer science (68R99)

Related Items (4)

Detection of rotational and involutional symmetries and congruity of polyhedra ⋮ On determining the congruence of point sets in \(d\) dimensions ⋮ Testing congruence and symmetry for general 3-dimensional objects. ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computer aided design modelling, systems engineering, CAD-systems. CREST Advanced Course, Darmstadt, 8.-19. September 1980
• A scene description method using three-dimensional information
• Finding the intersection of two convex polyhedra
• A V log V algorithm for isomorphism of triconnected planar graphs
• A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem
• Convex hulls of finite sets of points in two and three dimensions
• Determining the Three-dimensional Convex Hull of a Polyhedron

This page was built for publication: An n log n algorithm for determining the congruity of polyhedra