A parallel algorithm for finding congruent regions
Resource
Computers & Graphics 16 (3): 289-294
Journal
Computers & Graphics
Journal Volume
16
Journal Issue
3
Pages
289-294
Date Issued
1992
Date
1992
Author(s)
Liaw, Horng-Twu
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. © 1992.
Other Subjects
Algorithms; Computer graphics; Data storage equipment; Graph theory; Congruent regions; Parallel algorithms; Shared memories; Image analysis
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
02.pdf
Size
495.62 KB
Format
Adobe PDF
Checksum
(MD5):13bfd4b9d5ab6ee3b5b5c1739c8f12f6