On determining the congruence of point sets in d dimensions
Author:
- 31 March 1998
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 9 (4) , 247-256
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- On determining the congruity of point sets in higher dimensions1994
- Birthday paradox, coupon collectors, caching algorithms and self-organizing searchDiscrete Applied Mathematics, 1992
- Approximate decision algorithms for point set congruence1992
- Algorithms for determining the geometrical congruity in two and three dimensions1992
- A randomized parallel algorithm for planar graph isomorphism1990
- Congruence, similarity, and symmetries of geometric objectsDiscrete & Computational Geometry, 1988
- An optimal algorithm for geometrical congruenceJournal of Algorithms, 1987
- Optimal algorithms for finding the symmetries of a planar point setInformation Processing Letters, 1986
- An n log n algorithm for determining the congruity of polyhedraJournal of Computer and System Sciences, 1984
- An application of pattern matching to a problem in geometrical complexityInformation Processing Letters, 1976