Lei, Chin-LaungChin-LaungLeiLiaw, Horng-TwuHorng-TwuLiaw2009-02-272018-07-062009-02-272018-07-06199200978493http://ntur.lib.ntu.edu.tw//handle/246246/142106https://www.scopus.com/inward/record.uri?eid=2-s2.0-0026912159&doi=10.1016%2f0097-8493%2892%2990006-H&partnerID=40&md5=e19a55a77d5de33fc74631da90f790b4In 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. © 1992.application/pdf507519 bytesapplication/pdfen-USAlgorithms; Computer graphics; Data storage equipment; Graph theory; Congruent regions; Parallel algorithms; Shared memories; Image analysisjournal article2-s2.0-0026912159http://ntur.lib.ntu.edu.tw/bitstream/246246/142106/1/02.pdf