A parallel algorithm for finding congruent regions

DOI10.1016/0167-8191(90)90142-VMaRDI QIDQ1262793zbMATH OpenFDO

Authors K. Appert

Publication date 1990

Published in Parallel Computing (Search for Journal in Brave)

zbMATH Keywords

parallel algorithmcomputational geometrycomplexity analysiscongruent regions

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Finding congruent regions in parallel
• A parallel algorithm for the conductor of a point set
• An efficient parallel algorithm for planarity
• scientific article; zbMATH DE number 1196828
• A parallel algorithm for computing polygon set operations
• Parallel algorithms for some functions of two convex polygons
• A nearly parallel algorithm for the Voronoi diagram of a convex polygon
• An efficient parallel algorithm for finding minimum weight matching for points on a convex polygon
• Efficient parallel convex hull algorithms
• Parallel algorithms for separation of two sets of points and recognition of digital convex polygons

Cited in

(2)

• Parallel algorithm for corner finding on digital curves
• Finding congruent regions in parallel

This page was built for publication: A parallel algorithm for finding congruent regions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1262793)