An n log n algorithm for determining the congruity of polyhedra
From MaRDI portal
Publication:798003
DOI10.1016/0022-0000(84)90011-4zbMATH Open0546.68052OpenAlexW2061261588MaRDI QIDQ798003FDOQ798003
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
Recommendations
Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99) Polyhedra and polytopes; regular figures, division of spaces (51M20)
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?)
- Convex hulls of finite sets of points in two and three dimensions
- A V log V algorithm for isomorphism of triconnected planar graphs
- Finding the intersection of two convex polyhedra
- Computer aided design modelling, systems engineering, CAD-systems. CREST Advanced Course, Darmstadt, 8.-19. September 1980
- A scene description method using three-dimensional information
- A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem
- Determining the Three-dimensional Convex Hull of a Polyhedron
Cited In (5)
- Testing congruence and symmetry for general 3-dimensional objects.
- Detection of rotational and involutional symmetries and congruity of polyhedra
- On determining the congruence of point sets in \(d\) dimensions
- 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)
