An n log n algorithm for determining the congruity of polyhedra
- 1 August 1984
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 29 (1) , 36-47
- https://doi.org/10.1016/0022-0000(84)90011-4
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Representation of three-dimensional motion in dynamic scenesComputer Vision, Graphics, and Image Processing, 1983
- A Theoretical Analysis of Various Heuristics for the Graph Isomorphism ProblemSIAM Journal on Computing, 1980
- An algorithm for planning collision-free paths among polyhedral obstaclesCommunications of the ACM, 1979
- Interference detection among solids and surfacesCommunications of the ACM, 1979
- A scene description method using three-dimensional informationPattern Recognition, 1979
- Finding the intersection of two convex polyhedraTheoretical Computer Science, 1978
- Convex hulls of finite sets of points in two and three dimensionsCommunications of the ACM, 1977
- Determining the Three-dimensional Convex Hull of a PolyhedronIBM Journal of Research and Development, 1976
- The synthesis of solids bounded by many facesCommunications of the ACM, 1975
- A V log V algorithm for isomorphism of triconnected planar graphsJournal of Computer and System Sciences, 1973