An n log n algorithm for determining the congruity of polyhedra

DOI10.1016/0022-0000(84)90011-4MaRDI QIDQ798003zbMATH OpenOpenAlexFDO

Authors K. 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

algorithmasymptotic time complexitycomputational geometrycongruity of polyhedra

Mathematics Subject Classification ID

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

Recommendations

• An optimal algorithm for geometrical congruence
• scientific article; zbMATH DE number 4085021
• Finding congruent regions in parallel
• TESTING THE CONGRUENCE OF d-DIMENSIONAL POINT SETS
• scientific article; zbMATH DE number 3926242

Cites work

• A scene description method using three-dimensional information
• A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem
• A V log V algorithm for isomorphism of triconnected planar graphs
• Computer aided design modelling, systems engineering, CAD-systems. CREST Advanced Course, Darmstadt, 8.-19. September 1980
• Convex hulls of finite sets of points in two and three dimensions
• Determining the Three-dimensional Convex Hull of a Polyhedron
• Finding the intersection of two convex polyhedra
• scientific article; zbMATH DE number 3575612 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3449757 (Why is no real title available?)
• scientific article; zbMATH DE number 3308985 (Why is no real title available?)

Cited in

(5)

• On determining the congruence of point sets in \(d\) dimensions
• Testing congruence and symmetry for general 3-dimensional objects.
• Detection of rotational and involutional symmetries and congruity of polyhedra
• A feasible algorithm for checking \(n\)-scissors congruence of polyhedra in \({\mathbb R}^d\)
• A simple linear-time algorithm for computing the centroid and canonical form of a plane graph and its applications

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q798003)