ISAAC 1992: Algorithms and Computation pp 279-288

# Algorithms for determining the geometrical congruity in two and three dimensions

• Tatsuya Akutsu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 650)

## Abstract

This paper discusses the problem of determining the geometrical congruity. O(n log n) time algorithms for point sets in three dimensions and for graphs whose vertices are points in three dimensions are presented, respectively. They are based on Sugihara's algorithm for determining the congruity of polyhedra. Moreover, an O(log n) time O(n) processors parallel algorithm for graphs in two dimensions which works on a CRCW PRAM is presented. In this algorithm, the original problem is transformed into the string matching problem. All the algorithms are optimal and can be modified for computing the canonical forms.

## Keywords

Convex Hull Canonical Form Time Algorithm Random Access Machine String Match Algorithm
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

## References

1. 1.
Ajitai, M., Komós, J., Szemerédi, E.: Sorting in c log(n) parallel steps. Combinatorica 3 (1983) 1–19Google Scholar
2. 2.
Atkinson, M. D.: An optimal algorithm for geometrical congruence. J. Algorithms 8 (1987) 159–172
3. 3.
Coxeter, H. S. M.: Regular Complex Polytopes. Cambridge University Press (1974)Google Scholar
4. 4.
Hopcroft, J. E., Tarjan, R. E.: A V log V algorithm for isomorphism of triconnected planar graphs. J. Computer and System Sciences 7 (1973) 323–331Google Scholar
5. 5.
Iliopoulos, C. S., Smyth, W. F.: Optimal algorithms for computing the canonical form of a circular string. Theoretical Computer Science 92 (1992) 87–105
6. 6.
Manacher, G.: An application of pattern matching to a problem in geometrical complexity. Information Processing Letters 5 (1976) 6–7Google Scholar
7. 7.
Preparata, F. P., Shamos, M. I.: Computational Geometry — An Introduction. Springer-Verlag, New York (1985)Google Scholar
8. 8.
Sugihara, K.: An n log n algorithm for determining the congruity of polyhedra. J. Computer and System Sciences 29 (1984) 36–47
9. 9.
Vishkin, U.: Optimal parallel pattern matching in strings. Information and Control 67 (1985) 91–113