A parallel algorithm for finding congruent regions

doi:10.1016/0167-8191(90)90142-V

Parallel Computing

Volume 13, Issue 2, February 1990, Pages 135-142

https://doi.org/10.1016/0167-8191(90)90142-V Get rights and content

Abstract

In this paper, we discuss the problem of finding all the regions, which are congruent to a testing region, in a planar figure. A parallel algorithm is developed to find all of these regions. This algorithm takes O(n²) computation time and needs O(m) processors where n and m are the numbers of edges of the input planar figure and the testing region respectively.

References (15)

S.G Akl et al.
An improved algorithm to check for polygon similarity
Inform. Process. Lett.
(1978)
M.D Atkinson
An optimal algorithm for geometrical congruence
J. Algorithms
(1987)
K Sugihara
An n log n algorithm for determining the congruity of polyhedra
J. Comput. System. Sci.
(1984)
A Aggarwal et al.
Parallel computational geometry
H Alt et al.
Congruence, similarity, and symmetrics of geometric objects
M.J Atallah
Checking similarity of planar figures
Int. J. Comput. Inform. Sci.
(1984)
M.J Atallah et al.
Efficient parallel solutions to geometric problems

There are more references available in the full text version of this article.

Cited by (7)

Scalable parallel algorithms for geometric pattern recognition
1999, Journal of Parallel and Distributed Computing
This paper considers a variety of geometric pattern recognition problems on input sets of size n using a coarse grained multicomputer model consisting of p processors with Ω(n/p) local memory each (i.e., Ω(n/p) memory cells of Θ(log n) bits apiece), where the processors are connected to an arbitrary interconnection network. It introduces efficient scalable parallel algorithms for a number of geometric problems including the rectangle finding problem, the maximal equally spaced collinear points problem, and the point set pattern matching problem. All of the algorithms presented are scalable in that they are applicable and efficient over a very wide range of ratios of problem size to number of processors. In addition to the practicality imparted by scalability, these algorithms are easy to implement in that all required communications can be achieved by a small number of calls to standard global routing operations.
Faster point set pattern matching in 3-D
1998, Pattern Recognition Letters
We improve upon the best previous upper bound for the volume of output for the Point Set Pattern Matching Problem (PSPM) in Euclidean 3-space, $R^{3}$ . This in turn yields a better running time than was previously known for a sequential algorithm to solve this problem. The previous best sequential running time for PSPM in $R^{3}$ is O $(kn^{5/2} [λ_{6} (n)/n]^{1/4} log n)$ time, where k is the size of the pattern and n is the size of the sample set. In the current paper, we show that a sequential algorithm can solve PSPM in $R^{3}$ in O $(kn^{2} [λ_{6} (n)/n]^{1/2} log n)$ time.
Point set pattern matching in 3-D
1996, Pattern Recognition Letters
We give an algorithm for matching finite points sets in Euclidean 3-space, $R$ ³. The algorithm runs in $O (kn^{52} [λ_{6} (n)/n]^{14} log n)$ time, where k is the size of the pattern and _n is the size of the sample set. Further, if the pattern we seek to match is a collinear set, the running time of our algorithm reduces to $O (n^{2} + kn^{32} [λ_{6} (n)/n]^{case14} log n)$ . These results improve upon the O(kn³) running time of the algorithm given in (De Rezende and Lee, 1995) for the case d = 3.
Finding congruent regions in parallel
1992, Parallel Computing
Given a straight-line embedded plane graphh G of n edges and a polygon P of m edges, m≤n, we describe an algorithm for finding all polygons in G that are congruent to P. Our algorithm requires Θ(n log n) time for a CREW PRAM with m processors. This improves upon the O(n²) time (with m processors) required by the systolic array algorithmm of [7]. We also show the problem is in NC by showing how to implement our algorithm in Θ(log n) time using mn processors.
Image analysis and computer vision: 1990
1991, CVGIP: Image Understanding
This paper presents a bibliography of over 1600 references related to computer vision and image analysis, arranged by subject matter. The topics covered include architectures; computational techniques; feature detection, segmentation, and image analysis; matching, stereo, and time-varying imagery; shape and pattern; color and texture; and three-dimensional scene analysis. A few references are also given on related topics, such as computational geometry, computer graphics, image input/output and coding, image processing, optical processing, visual perception, neural nets, pattern recognition, and artificial intelligence.
A parallel algorithm for finding congruent regions
1992, Computers and Graphics
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.

View all citing articles on Scopus

View full text

A parallel algorithm for finding congruent regions

Abstract

Inform. Process. Lett.

J. Algorithms

J. Comput. System. Sci.

Parallel computational geometry

Congruence, similarity, and symmetrics of geometric objects

Checking similarity of planar figures

Int. J. Comput. Inform. Sci.

Efficient parallel solutions to geometric problems