Abstract
Purchase PDF (495 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (3)
Purchase PDF (645 K)
doi:10.1016/0097-8493(92)90006-H 
Copyright © 1992 Published by Elsevier Science Ltd.
Technical section
A parallel algorithm for finding congruent regions*1
Available online 11 June 2003.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
In this paper, we study the problem for finding all the regions, which are congruent to a testing region R, in an input planar figure F. In a shared memory system with m processors, we propose an efficient MAX {O(mn), O(n log n)} time parallel algorithm, where n, m are the numbers of edges of F and R, respectively. Furthermore, our algorithm does not require to read from or write into the same memory location simultaneously, hence it can be implemented on an exclusive-read, exclusive-write (EREW) model.
